java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:04:04,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:04:04,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:04:04,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:04:04,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:04:04,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:04:04,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:04:04,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:04:04,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:04:04,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:04:04,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:04:04,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:04:04,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:04:04,758 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:04:04,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:04:04,760 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:04:04,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:04:04,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:04:04,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:04:04,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:04:04,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:04:04,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:04:04,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:04:04,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:04:04,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:04:04,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:04:04,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:04:04,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:04:04,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:04:04,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:04:04,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:04:04,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:04:04,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:04:04,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:04:04,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:04:04,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:04:04,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 14:04:04,792 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:04:04,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:04:04,793 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:04:04,794 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:04:04,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:04:04,794 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:04:04,794 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:04:04,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:04:04,795 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:04:04,795 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:04:04,795 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:04:04,795 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:04:04,795 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:04:04,796 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:04:04,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:04:04,797 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:04:04,797 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:04:04,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:04:04,797 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:04:04,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:04:04,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:04:04,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:04:04,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:04:04,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:04:04,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:04:04,799 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:04:04,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:04:04,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:04:04,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:04:04,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:04:04,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:04:04,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:04:04,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:04:04,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:04:04,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:04:04,801 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:04:04,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:04:04,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:04:04,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:04:04,801 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:04:04,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:04:04,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:04:04,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:04:04,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:04:04,857 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:04:04,858 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-08 14:04:04,858 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-08 14:04:04,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:04:04,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:04:04,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:04,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:04:04,899 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:04:04,916 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,928 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:04,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:04:04,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:04:04,955 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:04:04,967 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,967 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,968 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,969 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,972 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,975 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,977 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 08.01 02:04:04" (1/1) ... [2019-01-08 14:04:04,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:04:04,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:04:04,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:04:04,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:04:04,982 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 08.01 02:04:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:04:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:04:05,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:04:05,409 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:04:05,410 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-08 14:04:05,411 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:05 BoogieIcfgContainer [2019-01-08 14:04:05,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:04:05,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:04:05,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:04:05,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:04:05,416 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 08.01 02:04:04" (1/2) ... [2019-01-08 14:04:05,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8e80d8 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:04:05, skipping insertion in model container [2019-01-08 14:04:05,417 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 08.01 02:04:05" (2/2) ... [2019-01-08 14:04:05,419 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-08 14:04:05,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:04:05,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-08 14:04:05,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-08 14:04:05,487 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:04:05,487 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:04:05,488 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:04:05,488 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:04:05,488 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:04:05,488 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:04:05,488 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:04:05,489 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:04:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-08 14:04:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:04:05,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:05,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:04:05,514 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:05,521 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-08 14:04:05,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:05,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:05,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:05,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:05,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:05,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:05,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:05,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:05,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:05,771 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-08 14:04:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:05,964 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-08 14:04:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:05,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:04:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:05,979 INFO L225 Difference]: With dead ends: 21 [2019-01-08 14:04:05,979 INFO L226 Difference]: Without dead ends: 16 [2019-01-08 14:04:05,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-08 14:04:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-08 14:04:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-08 14:04:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-08 14:04:06,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-08 14:04:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:06,022 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-08 14:04:06,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-08 14:04:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:06,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:06,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:06,024 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-08 14:04:06,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:06,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:06,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:06,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:06,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:06,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:06,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:06,275 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:06,280 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-08 14:04:06,321 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:06,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:06,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:06,390 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:06,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:06,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:06,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:06,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:06,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:06,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:06,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:04:06,582 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-08 14:04:06,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:06,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:06,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:06,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:06,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:06,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:06,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:06,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:06,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:06,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:06,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:06,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:06,858 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-08 14:04:07,104 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-08 14:04:07,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:07,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:07,147 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-08 14:04:07,313 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-08 14:04:07,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:07,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:07,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:07,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:07,340 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-08 14:04:07,341 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:07,358 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:07,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:07,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:07,413 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:07,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:07,512 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-08 14:04:07,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:07,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:07,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:07,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:07,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:07,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:07,738 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-08 14:04:08,019 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-08 14:04:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:08,362 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-08 14:04:08,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:08,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:08,366 INFO L225 Difference]: With dead ends: 31 [2019-01-08 14:04:08,366 INFO L226 Difference]: Without dead ends: 28 [2019-01-08 14:04:08,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-08 14:04:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-08 14:04:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:04:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-08 14:04:08,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-08 14:04:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:08,374 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-08 14:04:08,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-08 14:04:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:08,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:08,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:08,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-08 14:04:08,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:08,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:08,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:08,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:08,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:08,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:08,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:08,412 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-08 14:04:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:08,449 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-08 14:04:08,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:08,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 14:04:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:08,450 INFO L225 Difference]: With dead ends: 15 [2019-01-08 14:04:08,450 INFO L226 Difference]: Without dead ends: 14 [2019-01-08 14:04:08,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-08 14:04:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-08 14:04:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:04:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-08 14:04:08,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-08 14:04:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:08,457 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-08 14:04:08,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-08 14:04:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:08,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:08,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:08,458 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-08 14:04:08,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:08,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:08,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:08,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:08,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:08,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:08,499 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-08 14:04:08,501 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:08,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:08,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:08,508 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:08,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:08,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:08,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:08,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:08,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:08,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:08,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:08,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:04:08,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:08,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:08,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:08,601 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-08 14:04:08,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:08,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:08,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:08,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:08,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:08,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:08,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:08,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:08,711 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-08 14:04:08,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:08,716 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:08,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:08,734 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-01-08 14:04:08,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:08,770 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-08 14:04:08,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:08,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:08,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:08,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:08,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:08,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:04:08,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:08,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:08,862 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-08 14:04:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:09,063 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-08 14:04:09,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:04:09,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:04:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:09,064 INFO L225 Difference]: With dead ends: 18 [2019-01-08 14:04:09,064 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 14:04:09,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 14:04:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-08 14:04:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 14:04:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-08 14:04:09,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-08 14:04:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:09,070 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-08 14:04:09,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-08 14:04:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:09,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:09,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:09,071 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-08 14:04:09,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:09,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:09,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:09,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:09,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:09,130 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-08 14:04:09,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:09,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:09,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:09,138 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:09,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:09,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:09,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:09,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:09,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:09,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:09,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-08 14:04:09,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,249 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-08 14:04:09,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:09,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:09,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, 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-08 14:04:09,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:09,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:09,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, 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-08 14:04:09,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:09,373 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:09,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:09,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:09,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:09,413 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-08 14:04:09,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,460 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-08 14:04:09,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:09,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-08 14:04:09,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:09,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:09,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:09,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:09,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:09,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:09,525 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-08 14:04:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:09,708 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-08 14:04:09,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:09,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:09,709 INFO L225 Difference]: With dead ends: 32 [2019-01-08 14:04:09,709 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 14:04:09,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 14:04:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-08 14:04:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 14:04:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-08 14:04:09,717 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-08 14:04:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:09,717 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-08 14:04:09,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-08 14:04:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:09,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:09,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:09,718 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:09,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-08 14:04:09,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:09,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:09,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:09,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:09,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:09,828 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:09,828 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-08 14:04:09,831 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:09,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:09,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:09,841 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:09,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:09,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:09,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:09,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:09,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:09,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:09,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-08 14:04:09,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,954 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-08 14:04:09,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:09,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,000 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-08 14:04:10,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,043 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-08 14:04:10,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, 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-08 14:04:10,070 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-08 14:04:10,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:10,083 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,113 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:10,182 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,222 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-08 14:04:10,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:10,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:10,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:04:10,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:10,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:04:10,391 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-08 14:04:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:10,436 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-08 14:04:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:10,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:04:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:10,438 INFO L225 Difference]: With dead ends: 22 [2019-01-08 14:04:10,438 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 14:04:10,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:04:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 14:04:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-08 14:04:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-08 14:04:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-08 14:04:10,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-08 14:04:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:10,445 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-08 14:04:10,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-08 14:04:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:10,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:10,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:10,446 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-08 14:04:10,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:10,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:10,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:10,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:10,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:10,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:10,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:10,517 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-08 14:04:10,520 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:10,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:10,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:10,526 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:10,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:10,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:10,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:10,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:10,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:10,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:10,570 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-08 14:04:10,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:10,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:10,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:10,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,682 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-08 14:04:10,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,715 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-08 14:04:10,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,845 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-08 14:04:10,845 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,880 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,887 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,908 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-08 14:04:10,908 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:10,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,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, 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-08 14:04:10,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:10,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:10,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:10,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:10,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,001 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:11,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:11,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:11,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:11,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-08 14:04:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:11,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:11,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:11,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:11,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:11,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:11,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:11,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:11,129 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-08 14:04:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:11,583 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-08 14:04:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:11,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:11,585 INFO L225 Difference]: With dead ends: 37 [2019-01-08 14:04:11,585 INFO L226 Difference]: Without dead ends: 36 [2019-01-08 14:04:11,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-08 14:04:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-08 14:04:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:04:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-08 14:04:11,592 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-08 14:04:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:11,592 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-08 14:04:11,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-08 14:04:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:11,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:11,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:11,594 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:11,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-08 14:04:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:11,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:11,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:11,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:11,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:11,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:11,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:11,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:11,718 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-08 14:04:11,720 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:11,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:11,726 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:11,726 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:11,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:11,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:11,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:11,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:11,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:11,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:11,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,764 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-08 14:04:11,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-08 14:04:11,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:11,857 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-08 14:04:11,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:11,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:11,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:11,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:04:11,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:11,977 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-08 14:04:11,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:11,981 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:12,014 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:12,023 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:12,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:12,066 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-08 14:04:12,067 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:12,283 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-08 14:04:12,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:12,315 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-08 14:04:12,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:12,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:12,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:12,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:12,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:12,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:12,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:12,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:12,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:12,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:12,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:12,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:12,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:12,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:12,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:12,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:12,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:12,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:12,717 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-08 14:04:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:13,180 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-01-08 14:04:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:13,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:13,182 INFO L225 Difference]: With dead ends: 46 [2019-01-08 14:04:13,182 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 14:04:13,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:04:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 14:04:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-08 14:04:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 14:04:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-08 14:04:13,191 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-08 14:04:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:13,191 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-08 14:04:13,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-08 14:04:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:13,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:13,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:13,192 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-08 14:04:13,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:13,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:13,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:13,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:13,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:13,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:13,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:13,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:13,362 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-08 14:04:13,364 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:13,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:13,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:13,368 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:13,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:13,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:13,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:13,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:13,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:13,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:13,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:04:13,423 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-08 14:04:13,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:13,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:13,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,603 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,636 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-08 14:04:13,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-08 14:04:13,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,702 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-08 14:04:13,703 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,713 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,722 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:13,744 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:13,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,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 51 [2019-01-08 14:04:13,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:13,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:13,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:13,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:13,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:13,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:13,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:04:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:13,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:13,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:13,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:13,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:13,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:13,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:13,924 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-08 14:04:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:14,125 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-01-08 14:04:14,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:14,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:14,127 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:04:14,127 INFO L226 Difference]: Without dead ends: 49 [2019-01-08 14:04:14,127 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-08 14:04:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-08 14:04:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-01-08 14:04:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:04:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-01-08 14:04:14,136 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-01-08 14:04:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:14,137 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-01-08 14:04:14,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-01-08 14:04:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:14,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:14,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:14,138 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-08 14:04:14,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:14,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:14,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:14,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:14,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:14,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:14,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:14,175 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-08 14:04:14,176 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:14,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:14,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:14,180 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:14,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:14,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:14,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:14,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:14,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:14,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:14,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,223 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-08 14:04:14,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,251 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-08 14:04:14,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:14,273 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-08 14:04:14,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:14,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:14,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,307 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:14,341 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-08 14:04:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,370 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-08 14:04:14,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:14,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:14,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:14,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-08 14:04:14,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:14,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:14,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:14,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:14,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:14,490 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-01-08 14:04:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:14,691 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-01-08 14:04:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:14,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:04:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:14,693 INFO L225 Difference]: With dead ends: 36 [2019-01-08 14:04:14,693 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 14:04:14,694 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-08 14:04:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 14:04:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-08 14:04:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 14:04:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-01-08 14:04:14,703 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-01-08 14:04:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:14,703 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-01-08 14:04:14,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-01-08 14:04:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:14,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:14,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:14,704 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-08 14:04:14,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:14,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:14,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:14,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:14,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:14,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:14,779 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-08 14:04:14,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:14,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:14,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:14,785 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:14,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:14,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:14,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:14,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:14,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:14,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:14,824 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-08 14:04:14,827 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-08 14:04:14,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:14,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:04:14,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:14,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:14,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:14,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:15,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,017 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-08 14:04:15,018 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,028 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,041 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,062 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-08 14:04:15,062 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:15,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,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, 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-08 14:04:15,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:15,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:15,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,218 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-08 14:04:15,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:15,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:15,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:15,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:15,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:15,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:15,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:15,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:15,307 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-01-08 14:04:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:15,739 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-01-08 14:04:15,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:15,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:15,742 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:04:15,742 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 14:04:15,742 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-08 14:04:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 14:04:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-01-08 14:04:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:04:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-01-08 14:04:15,754 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-01-08 14:04:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:15,754 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-01-08 14:04:15,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-01-08 14:04:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:15,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:15,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:15,755 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-08 14:04:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:15,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:15,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:15,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:15,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:15,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:15,799 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-08 14:04:15,800 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:15,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:15,804 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:15,805 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:15,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:15,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:15,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:15,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:15,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:15,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:15,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:15,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:15,841 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-08 14:04:15,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,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, 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-08 14:04:15,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:15,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:15,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:15,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:15,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-08 14:04:16,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,006 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-08 14:04:16,006 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,013 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:16,040 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-01-08 14:04:16,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:16,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:16,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-08 14:04:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:16,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:16,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:16,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:16,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:16,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:16,239 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-01-08 14:04:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:16,359 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-01-08 14:04:16,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:16,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:04:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:16,360 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:04:16,360 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 14:04:16,361 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-08 14:04:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 14:04:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-08 14:04:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:04:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-08 14:04:16,371 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-01-08 14:04:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:16,371 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-08 14:04:16,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-08 14:04:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:16,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:16,372 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 14:04:16,372 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-01-08 14:04:16,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:16,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:16,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:16,450 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-08 14:04:16,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:16,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:16,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:16,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:16,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:16,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:16,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:16,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:16,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:16,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:16,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:16,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:16,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:16,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,596 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-08 14:04:16,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,643 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-08 14:04:16,646 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-08 14:04:16,650 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-08 14:04:16,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:16,653 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,666 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,676 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:16,703 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:16,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:16,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:16,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:16,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:16,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-01-08 14:04:16,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:16,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:16,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:16,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:16,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:16,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:16,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:16,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:04:16,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:16,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:04:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:04:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:16,888 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-01-08 14:04:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:17,252 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-01-08 14:04:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:17,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-08 14:04:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:17,254 INFO L225 Difference]: With dead ends: 65 [2019-01-08 14:04:17,254 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 14:04:17,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 14:04:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-01-08 14:04:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:04:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-08 14:04:17,265 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-08 14:04:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:17,265 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-08 14:04:17,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:04:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-08 14:04:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:17,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:17,266 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 14:04:17,267 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-01-08 14:04:17,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:17,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:17,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:17,397 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-08 14:04:17,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:17,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:17,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:17,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:17,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:17,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:17,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:17,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:17,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:17,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:17,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:17,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:04:17,439 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-08 14:04:17,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:17,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:17,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,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-08 14:04:17,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:17,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,576 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-08 14:04:17,576 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,593 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,619 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-08 14:04:17,619 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:17,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:17,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,679 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-08 14:04:17,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:17,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:17,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:17,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-08 14:04:17,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:17,774 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-08 14:04:17,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:17,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:17,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:17,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-08 14:04:17,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:17,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:04:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:04:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:04:17,895 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-01-08 14:04:18,114 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-01-08 14:04:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:18,359 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-01-08 14:04:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:18,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-08 14:04:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:18,361 INFO L225 Difference]: With dead ends: 53 [2019-01-08 14:04:18,361 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 14:04:18,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 14:04:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-01-08 14:04:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:04:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-08 14:04:18,372 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-08 14:04:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:18,372 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-08 14:04:18,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:04:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-08 14:04:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:18,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:18,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:18,373 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:18,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-08 14:04:18,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:18,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:18,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:18,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:18,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:18,464 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:18,464 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-08 14:04:18,466 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:18,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:18,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:18,470 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:18,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:18,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:18,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:18,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:18,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:18,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,505 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-08 14:04:18,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,589 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-08 14:04:18,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,620 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-08 14:04:18,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,654 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-08 14:04:18,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:18,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, 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-08 14:04:18,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:18,662 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,686 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,694 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,711 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-08 14:04:18,712 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:18,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,743 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-08 14:04:18,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:18,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:18,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:18,792 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-08 14:04:18,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:18,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:18,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:18,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:18,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:18,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:18,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:18,875 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-01-08 14:04:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:19,113 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-01-08 14:04:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:19,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:19,114 INFO L225 Difference]: With dead ends: 54 [2019-01-08 14:04:19,115 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 14:04:19,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 14:04:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-08 14:04:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 14:04:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-01-08 14:04:19,128 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-01-08 14:04:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:19,128 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-01-08 14:04:19,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-01-08 14:04:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:19,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:19,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:19,129 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-01-08 14:04:19,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:19,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:19,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:19,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:19,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:19,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:19,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:19,269 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-08 14:04:19,270 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:19,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:19,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:19,274 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:19,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:19,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:19,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:19,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:19,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:19,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:19,317 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-08 14:04:19,331 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-08 14:04:19,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:19,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:19,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,402 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-08 14:04:19,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,422 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-08 14:04:19,422 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,459 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-08 14:04:19,460 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-08 14:04:19,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,504 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-08 14:04:19,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-08 14:04:19,587 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-08 14:04:19,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:100 [2019-01-08 14:04:19,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,696 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:19,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:19,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,745 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:19,746 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-08 14:04:19,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,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, 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-08 14:04:19,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,852 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-08 14:04:19,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:97, output treesize:63 [2019-01-08 14:04:19,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-01-08 14:04:19,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:19,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:19,964 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:19,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:19,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:20,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:20,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:20,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:20,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:20,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:20,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:20,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:20,055 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-08 14:04:20,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-01-08 14:04:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:20,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:20,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:20,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-01-08 14:04:20,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:20,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:20,143 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-01-08 14:04:20,896 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-01-08 14:04:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:21,541 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-01-08 14:04:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 14:04:21,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:04:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:21,543 INFO L225 Difference]: With dead ends: 81 [2019-01-08 14:04:21,543 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:04:21,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:04:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:04:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-01-08 14:04:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 14:04:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-01-08 14:04:21,561 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-01-08 14:04:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-01-08 14:04:21,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-01-08 14:04:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:21,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:21,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:21,563 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:21,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:21,563 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-08 14:04:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:21,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:21,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:21,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:21,718 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-08 14:04:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:21,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:21,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:21,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:21,920 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-08 14:04:21,921 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:21,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:21,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:21,925 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:21,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:21,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:21,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:21,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:21,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:21,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:21,965 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-08 14:04:21,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:04:21,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:21,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:21,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:21,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:21,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:21,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:04:21,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,054 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-08 14:04:22,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,083 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-08 14:04:22,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,120 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-08 14:04:22,121 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,141 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,163 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:22,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:22,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,252 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-08 14:04:22,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:22,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,280 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:22,282 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-08 14:04:22,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:22,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-01-08 14:04:22,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:22,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:22,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:22,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:22,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-08 14:04:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:22,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:22,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:22,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:22,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:22,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:22,455 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-01-08 14:04:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:22,926 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-08 14:04:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:22,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:04:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:22,929 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:04:22,929 INFO L226 Difference]: Without dead ends: 64 [2019-01-08 14:04:22,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:04:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-08 14:04:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-01-08 14:04:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:04:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-08 14:04:22,949 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-08 14:04:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:22,949 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-08 14:04:22,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-08 14:04:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:22,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:22,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:22,951 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:22,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:22,951 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-08 14:04:22,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:22,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:22,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:23,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:23,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:23,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:23,047 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-08 14:04:23,050 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:23,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:23,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:23,057 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:23,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:23,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:23,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:23,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:23,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:23,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:23,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:23,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, 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-08 14:04:23,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:23,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:23,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:23,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:23,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:23,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:23,146 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-08 14:04:23,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:23,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:23,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:23,177 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-08 14:04:23,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-08 14:04:23,221 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-08 14:04:23,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:23,259 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:23,491 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:23,612 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:23,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:23,846 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-08 14:04:23,846 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:04:24,237 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-08 14:04:24,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:24,277 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-08 14:04:24,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:24,405 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-08 14:04:24,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:24,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:24,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:24,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:24,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:24,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:24,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:24,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-08 14:04:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:24,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:24,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:24,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:24,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:24,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:24,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:24,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:24,516 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-01-08 14:04:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:24,747 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-01-08 14:04:24,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:24,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:24,749 INFO L225 Difference]: With dead ends: 62 [2019-01-08 14:04:24,749 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 14:04:24,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 14:04:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-08 14:04:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:04:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-01-08 14:04:24,761 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-01-08 14:04:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:24,762 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-01-08 14:04:24,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-01-08 14:04:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:24,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:24,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:24,763 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-08 14:04:24,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:24,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:24,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:24,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:24,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:04:24,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:24,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:04:24,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:24,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:24,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:24,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:04:24,891 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-01-08 14:04:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:24,952 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-01-08 14:04:24,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:04:24,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:04:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:24,954 INFO L225 Difference]: With dead ends: 51 [2019-01-08 14:04:24,954 INFO L226 Difference]: Without dead ends: 46 [2019-01-08 14:04:24,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:04:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-08 14:04:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-08 14:04:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:04:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-01-08 14:04:24,969 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-01-08 14:04:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:24,970 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-01-08 14:04:24,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-01-08 14:04:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:24,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:24,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:24,971 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-01-08 14:04:24,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:24,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:24,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:25,194 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-08 14:04:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:25,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:25,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:25,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:25,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:25,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:25,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:25,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:25,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:25,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:25,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:25,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:25,269 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-08 14:04:25,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:04:25,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:25,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:25,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:25,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:25,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:25,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:25,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,366 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-08 14:04:25,705 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-08 14:04:25,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:25,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:26,099 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-08 14:04:26,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,106 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-08 14:04:26,107 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:26,116 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:26,125 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:26,168 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-08 14:04:26,169 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:26,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:04:26,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:26,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:26,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:26,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,369 INFO L303 Elim1Store]: Index analysis took 140 ms [2019-01-08 14:04:26,370 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-08 14:04:26,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:26,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:26,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:04:26,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:26,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:26,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:26,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:26,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:26,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:04:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:26,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:26,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:26,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:04:26,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:26,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:26,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:26,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:26,871 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-01-08 14:04:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:27,639 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-01-08 14:04:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:04:27,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:04:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:27,641 INFO L225 Difference]: With dead ends: 90 [2019-01-08 14:04:27,641 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 14:04:27,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:04:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 14:04:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-01-08 14:04:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:04:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-01-08 14:04:27,668 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-01-08 14:04:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:27,668 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-01-08 14:04:27,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-01-08 14:04:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:27,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:27,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:27,669 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:27,669 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-08 14:04:27,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:27,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:27,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:27,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:27,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:27,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:27,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:27,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:27,727 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-08 14:04:27,728 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:27,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:27,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:27,731 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:27,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:27,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:27,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:27,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:27,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:27,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:27,772 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-08 14:04:27,774 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-08 14:04:27,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,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, 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-08 14:04:27,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:04:27,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:27,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:27,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:27,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:27,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,845 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-08 14:04:27,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:27,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:27,924 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-08 14:04:27,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:27,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:27,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:27,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:27,960 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:28,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:28,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:28,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-08 14:04:28,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:28,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,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 31 treesize of output 57 [2019-01-08 14:04:28,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:28,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:28,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:04:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:28,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:28,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:28,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:28,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:28,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:28,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:28,279 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-01-08 14:04:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:28,808 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-01-08 14:04:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:28,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:28,810 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:04:28,810 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 14:04:28,811 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-08 14:04:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 14:04:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-08 14:04:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 14:04:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-01-08 14:04:28,835 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-01-08 14:04:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:28,836 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-01-08 14:04:28,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-01-08 14:04:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:28,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:28,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:28,836 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-08 14:04:28,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:28,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:28,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:28,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:04:28,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:28,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:28,879 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:28,880 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-08 14:04:28,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:28,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:28,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:28,884 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:28,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:28,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:28,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:28,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:28,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:28,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,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, 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-08 14:04:28,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:28,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,981 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-08 14:04:28,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:28,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:29,019 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-08 14:04:29,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:29,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:29,024 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,038 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,055 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,225 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-08 14:04:29,225 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:29,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:29,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:29,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:29,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,313 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:29,314 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-08 14:04:29,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:29,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-08 14:04:29,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-08 14:04:29,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:04:29,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:04:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:04:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:29,391 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-01-08 14:04:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:29,618 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-01-08 14:04:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:29,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-08 14:04:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:29,621 INFO L225 Difference]: With dead ends: 63 [2019-01-08 14:04:29,621 INFO L226 Difference]: Without dead ends: 62 [2019-01-08 14:04:29,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:04:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-08 14:04:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-08 14:04:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 14:04:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-01-08 14:04:29,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-01-08 14:04:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:29,640 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-01-08 14:04:29,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:04:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-01-08 14:04:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:29,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:29,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:29,641 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-08 14:04:29,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:29,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:29,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:29,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:29,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:29,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:29,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:29,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:29,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:29,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:29,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:04:29,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:29,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:29,747 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-08 14:04:29,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:29,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:29,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:04:29,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,820 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-08 14:04:29,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,846 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-08 14:04:29,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,897 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-08 14:04:29,897 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,906 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:29,934 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:29,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,955 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-08 14:04:29,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:29,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:29,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,999 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-08 14:04:30,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,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-08 14:04:30,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:30,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-08 14:04:30,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:30,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:30,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:30,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:30,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:30,074 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-01-08 14:04:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:30,269 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-01-08 14:04:30,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:30,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:30,271 INFO L225 Difference]: With dead ends: 86 [2019-01-08 14:04:30,271 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:04:30,271 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-08 14:04:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:04:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-01-08 14:04:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:04:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-01-08 14:04:30,299 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-01-08 14:04:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:30,300 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-01-08 14:04:30,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-01-08 14:04:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:30,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:30,301 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-08 14:04:30,301 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:30,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-01-08 14:04:30,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:30,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:30,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:30,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:30,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:30,460 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-08 14:04:30,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:30,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:30,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:30,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:30,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:30,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:04:30,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:04:30,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:04:30,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:30,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:30,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,493 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-08 14:04:30,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,526 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-08 14:04:30,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,559 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-08 14:04:30,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,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-08 14:04:30,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-08 14:04:30,599 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-08 14:04:30,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:30,606 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,621 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,638 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,647 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:30,666 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:30,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:30,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:30,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:30,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:30,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:30,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-08 14:04:30,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:04:30,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:30,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:30,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,923 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-08 14:04:30,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:30,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:04:30,984 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-08 14:04:30,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:31,045 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-08 14:04:31,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:31,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-08 14:04:31,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:31,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:31,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:04:31,073 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-01-08 14:04:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:31,508 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-01-08 14:04:31,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:31,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:04:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:31,510 INFO L225 Difference]: With dead ends: 96 [2019-01-08 14:04:31,510 INFO L226 Difference]: Without dead ends: 90 [2019-01-08 14:04:31,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-08 14:04:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-01-08 14:04:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-08 14:04:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-01-08 14:04:31,534 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-01-08 14:04:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:31,534 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-01-08 14:04:31,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-01-08 14:04:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:31,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:31,535 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:04:31,535 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:31,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:31,535 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-01-08 14:04:31,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,694 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-08 14:04:31,714 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-08 14:04:31,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:31,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:31,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:31,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:31,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:04:31,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:04:31,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:04:31,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:31,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:31,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:31,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,904 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-08 14:04:31,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,941 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-08 14:04:31,944 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-08 14:04:31,947 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-08 14:04:31,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:31,951 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,968 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,977 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,005 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-08 14:04:32,006 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:32,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:32,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,054 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-08 14:04:32,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:32,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:32,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:32,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-08 14:04:32,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,165 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-08 14:04:32,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:32,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,225 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-08 14:04:32,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:32,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-08 14:04:32,276 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-08 14:04:32,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:32,403 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-08 14:04:32,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:32,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:04:32,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:32,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:04:32,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:04:32,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:32,424 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-01-08 14:04:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:32,931 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-01-08 14:04:32,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:32,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:04:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:32,933 INFO L225 Difference]: With dead ends: 107 [2019-01-08 14:04:32,933 INFO L226 Difference]: Without dead ends: 106 [2019-01-08 14:04:32,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:04:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-08 14:04:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-01-08 14:04:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 14:04:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-01-08 14:04:32,970 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-01-08 14:04:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:32,970 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-01-08 14:04:32,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:04:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-01-08 14:04:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:32,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:32,971 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:04:32,971 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-01-08 14:04:32,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:32,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:32,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:33,299 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-08 14:04:33,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:33,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:33,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:33,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:33,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:33,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:33,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:33,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:33,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:33,330 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-08 14:04:33,333 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-08 14:04:33,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:33,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:33,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,370 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,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, 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-08 14:04:33,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,425 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-08 14:04:33,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,458 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-08 14:04:33,458 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,468 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,477 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,495 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-08 14:04:33,496 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:33,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,552 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-08 14:04:33,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,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 1 xjuncts. [2019-01-08 14:04:33,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:33,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:33,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:33,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:33,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,699 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-08 14:04:33,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:33,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-01-08 14:04:33,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:33,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:33,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-08 14:04:33,797 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-08 14:04:33,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:33,848 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-08 14:04:33,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:33,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:04:33,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:33,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:04:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:04:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:33,867 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-01-08 14:04:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:34,278 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-01-08 14:04:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:34,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:04:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:34,281 INFO L225 Difference]: With dead ends: 116 [2019-01-08 14:04:34,281 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 14:04:34,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:04:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 14:04:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-01-08 14:04:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:04:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-01-08 14:04:34,306 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-01-08 14:04:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:34,306 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-01-08 14:04:34,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:04:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-01-08 14:04:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:34,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:34,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:34,307 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-08 14:04:34,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:34,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:34,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:04:34,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:34,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:34,386 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:34,386 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-08 14:04:34,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:34,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:34,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:34,393 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:34,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:34,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:34,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:34,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:34,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:34,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:34,431 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-08 14:04:34,433 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-08 14:04:34,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:34,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:34,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:34,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,537 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-08 14:04:34,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,586 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-08 14:04:34,587 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,604 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,622 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-08 14:04:34,623 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:34,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:34,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:34,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:34,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:34,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:34,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:34,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:34,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:34,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:34,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:34,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:34,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:34,770 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-01-08 14:04:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:35,037 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-01-08 14:04:35,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:35,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:04:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:35,038 INFO L225 Difference]: With dead ends: 72 [2019-01-08 14:04:35,039 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:04:35,039 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-08 14:04:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:04:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-01-08 14:04:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 14:04:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-01-08 14:04:35,070 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-01-08 14:04:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:35,071 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-01-08 14:04:35,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-01-08 14:04:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:35,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:35,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:35,072 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-08 14:04:35,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:35,144 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-08 14:04:35,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:35,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:35,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:35,145 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-08 14:04:35,146 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:35,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:35,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:35,148 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:35,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:35,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:35,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:35,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:35,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:35,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:35,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:35,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:35,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:35,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,281 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-08 14:04:35,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:35,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,341 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-08 14:04:35,342 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,376 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-08 14:04:35,377 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:35,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:35,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:35,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:35,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:35,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:35,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:35,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,487 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:35,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:35,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:35,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:04:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:35,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:35,554 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-08 14:04:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:04:35,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:35,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:35,575 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-01-08 14:04:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:35,962 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-01-08 14:04:35,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:35,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:04:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:35,964 INFO L225 Difference]: With dead ends: 77 [2019-01-08 14:04:35,964 INFO L226 Difference]: Without dead ends: 76 [2019-01-08 14:04:35,965 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-08 14:04:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-08 14:04:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-08 14:04:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 14:04:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-01-08 14:04:35,994 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-01-08 14:04:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:35,994 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-01-08 14:04:35,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-01-08 14:04:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:35,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:35,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:35,995 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-08 14:04:35,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:36,105 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-08 14:04:36,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:36,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:36,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:36,106 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-08 14:04:36,107 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:36,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:36,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:36,110 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:36,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:36,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:36,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:36,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:36,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:36,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:36,167 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-08 14:04:36,170 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-08 14:04:36,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:36,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:36,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,240 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-08 14:04:36,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,268 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-08 14:04:36,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,299 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-08 14:04:36,299 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,308 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,336 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:36,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:36,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,380 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-08 14:04:36,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:36,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:36,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:36,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,573 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:36,574 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-08 14:04:36,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:36,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:04:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:36,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:36,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:36,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:36,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:36,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:36,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:36,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:36,965 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-01-08 14:04:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:37,298 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-01-08 14:04:37,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:37,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:04:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:37,300 INFO L225 Difference]: With dead ends: 78 [2019-01-08 14:04:37,300 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 14:04:37,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:04:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 14:04:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-01-08 14:04:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 14:04:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-01-08 14:04:37,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-01-08 14:04:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:37,331 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-01-08 14:04:37,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:37,332 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-01-08 14:04:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:37,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:37,332 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:04:37,332 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-01-08 14:04:37,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:37,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:37,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:37,406 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-08 14:04:37,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:37,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:37,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:37,407 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-08 14:04:37,409 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:37,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:37,411 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:37,412 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:37,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:37,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:37,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:37,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:37,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:37,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:37,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-08 14:04:37,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:37,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,503 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-08 14:04:37,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:37,539 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-08 14:04:37,541 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-08 14:04:37,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:04:37,544 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,558 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,567 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,594 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-08 14:04:37,594 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:37,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:37,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,634 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-08 14:04:37,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:37,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:37,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:37,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:37,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,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, 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-08 14:04:37,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:37,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:04:37,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,774 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:37,775 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-08 14:04:37,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:37,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:04:37,822 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-08 14:04:37,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:37,873 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-08 14:04:37,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:37,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:04:37,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:37,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:04:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:04:37,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:37,893 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-01-08 14:04:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:38,385 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-01-08 14:04:38,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:38,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:04:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:38,386 INFO L225 Difference]: With dead ends: 95 [2019-01-08 14:04:38,387 INFO L226 Difference]: Without dead ends: 90 [2019-01-08 14:04:38,387 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-08 14:04:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-08 14:04:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-08 14:04:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:04:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-01-08 14:04:38,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-01-08 14:04:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:38,420 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-01-08 14:04:38,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:04:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-01-08 14:04:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:38,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:38,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:38,421 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-08 14:04:38,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:38,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:38,580 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-08 14:04:38,850 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-08 14:04:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:04:38,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:38,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:38,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:38,872 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-08 14:04:38,874 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:38,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:38,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:38,877 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:38,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:38,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:38,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:38,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:38,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:38,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:38,912 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-08 14:04:38,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, 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-08 14:04:38,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:38,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:39,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,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-08 14:04:39,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-08 14:04:39,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,178 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-08 14:04:39,178 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,188 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,216 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-08 14:04:39,217 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:39,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:39,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:39,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:39,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,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, 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-08 14:04:39,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:39,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:04:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:39,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:39,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:39,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-08 14:04:39,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:39,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:04:39,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:04:39,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:39,363 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-01-08 14:04:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:40,634 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-01-08 14:04:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:40,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:04:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:40,636 INFO L225 Difference]: With dead ends: 90 [2019-01-08 14:04:40,636 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 14:04:40,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 14:04:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-01-08 14:04:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-08 14:04:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-01-08 14:04:40,695 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-01-08 14:04:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:40,695 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-01-08 14:04:40,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:04:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-01-08 14:04:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:40,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:40,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:40,696 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-08 14:04:40,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:40,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:40,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:40,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:40,801 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-08 14:04:40,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:40,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:40,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:40,801 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-08 14:04:40,802 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:40,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:40,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:40,806 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:40,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:40,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:40,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:40,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:40,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:40,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:40,841 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-08 14:04:40,845 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-08 14:04:40,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,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-08 14:04:40,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:40,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,910 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-08 14:04:40,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,939 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-08 14:04:40,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,967 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-08 14:04:40,967 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-08 14:04:41,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,026 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-08 14:04:41,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,049 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-08 14:04:41,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:41,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,102 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:41,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-08 14:04:41,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:41,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-08 14:04:41,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:41,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:41,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-08 14:04:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:41,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:41,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:41,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:04:41,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:41,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:41,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:41,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:41,286 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-01-08 14:04:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:41,598 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-01-08 14:04:41,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:41,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:04:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:41,600 INFO L225 Difference]: With dead ends: 122 [2019-01-08 14:04:41,600 INFO L226 Difference]: Without dead ends: 121 [2019-01-08 14:04:41,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-08 14:04:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-01-08 14:04:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-08 14:04:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-01-08 14:04:41,655 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-01-08 14:04:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:41,655 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-01-08 14:04:41,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-01-08 14:04:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:41,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:41,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:41,656 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-08 14:04:41,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:04:41,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:41,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:41,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:41,800 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-08 14:04:41,801 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:41,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:41,804 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:41,804 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:41,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:41,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:41,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:41,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:41,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:41,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:41,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-08 14:04:41,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-08 14:04:41,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,902 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-08 14:04:41,906 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-08 14:04:41,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:41,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:41,916 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,934 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,942 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,965 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-08 14:04:41,966 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:04:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,997 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-08 14:04:41,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,009 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-08 14:04:42,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:42,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,028 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:42,029 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-08 14:04:42,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:42,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:04:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:42,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:42,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:42,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:42,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:42,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:42,118 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-01-08 14:04:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:42,338 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-01-08 14:04:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:42,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:04:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:42,340 INFO L225 Difference]: With dead ends: 113 [2019-01-08 14:04:42,340 INFO L226 Difference]: Without dead ends: 108 [2019-01-08 14:04:42,340 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-08 14:04:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-08 14:04:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-08 14:04:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 14:04:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-01-08 14:04:42,405 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-01-08 14:04:42,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:42,406 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-01-08 14:04:42,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-01-08 14:04:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:42,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:42,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:42,407 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:42,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-08 14:04:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:42,647 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-08 14:04:42,663 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-08 14:04:42,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:42,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:42,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:42,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:42,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:42,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:42,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:42,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:42,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:42,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:42,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,698 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-08 14:04:42,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,724 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-08 14:04:42,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,773 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-08 14:04:42,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,809 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-08 14:04:42,812 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-08 14:04:42,814 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-08 14:04:42,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:42,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,841 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,867 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-08 14:04:42,868 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:43,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,020 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-08 14:04:43,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,039 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-08 14:04:43,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:43,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:04:43,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:43,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,109 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:43,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,111 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-08 14:04:43,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:43,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:04:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:43,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:43,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:43,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:04:43,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:43,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:04:43,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:04:43,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:43,206 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-01-08 14:04:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:43,562 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-01-08 14:04:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:43,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:04:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:43,565 INFO L225 Difference]: With dead ends: 137 [2019-01-08 14:04:43,565 INFO L226 Difference]: Without dead ends: 136 [2019-01-08 14:04:43,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:04:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-08 14:04:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-08 14:04:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 14:04:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-01-08 14:04:43,623 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-01-08 14:04:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:43,623 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-01-08 14:04:43,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:04:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-01-08 14:04:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:43,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:43,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:43,624 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-08 14:04:43,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:43,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:43,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:43,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:43,936 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-08 14:04:43,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:43,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:43,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:43,941 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:43,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:43,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:43,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:43,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:44,027 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-08 14:04:44,146 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-08 14:04:44,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,249 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-08 14:04:44,249 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-08 14:04:44,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,341 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-08 14:04:44,344 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-08 14:04:44,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:44,356 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-08 14:04:44,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,368 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,375 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:44,395 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-01-08 14:04:44,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,459 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-08 14:04:44,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-08 14:04:44,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,577 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-08 14:04:44,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,584 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-08 14:04:44,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-08 14:04:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:44,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:44,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:44,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:44,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:44,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:44,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:44,630 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-01-08 14:04:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:44,831 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-01-08 14:04:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:44,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:04:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:44,833 INFO L225 Difference]: With dead ends: 110 [2019-01-08 14:04:44,834 INFO L226 Difference]: Without dead ends: 109 [2019-01-08 14:04:44,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:04:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-08 14:04:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-01-08 14:04:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-08 14:04:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-01-08 14:04:44,889 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-01-08 14:04:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:44,889 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-01-08 14:04:44,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-01-08 14:04:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:44,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:44,890 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:04:44,890 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:44,890 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-01-08 14:04:44,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:44,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:44,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:44,971 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-08 14:04:44,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:44,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:44,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:44,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:44,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:44,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:44,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:44,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:44,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:44,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:44,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:45,009 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-08 14:04:45,015 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-08 14:04:45,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:45,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:45,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,086 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-08 14:04:45,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:45,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,145 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-08 14:04:45,146 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,155 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,164 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,183 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-08 14:04:45,183 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:45,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,203 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-08 14:04:45,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:45,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:45,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,245 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-08 14:04:45,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:45,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:04:45,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,292 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:45,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:45,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:45,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-08 14:04:45,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,442 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-08 14:04:45,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:45,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:04:45,483 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-08 14:04:45,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:45,524 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-08 14:04:45,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:45,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:04:45,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:45,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:04:45,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:04:45,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:04:45,544 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-01-08 14:04:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:45,949 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-01-08 14:04:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:04:45,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:04:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:45,952 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:04:45,952 INFO L226 Difference]: Without dead ends: 116 [2019-01-08 14:04:45,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:04:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-08 14:04:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-01-08 14:04:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 14:04:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-01-08 14:04:46,009 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-01-08 14:04:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:46,010 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-01-08 14:04:46,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:04:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-01-08 14:04:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:46,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:46,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:46,011 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-01-08 14:04:46,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:46,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:46,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:46,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:46,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:46,174 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-08 14:04:46,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:46,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:46,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:04:46,175 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-08 14:04:46,175 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:46,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:46,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:46,178 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:04:46,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:46,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:46,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:46,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:46,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:46,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:46,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:46,213 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-08 14:04:46,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, 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-08 14:04:46,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:46,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:46,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,355 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-08 14:04:46,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,384 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-08 14:04:46,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,440 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-08 14:04:46,440 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,449 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,476 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:46,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,501 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-08 14:04:46,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:46,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:46,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:04:46,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,596 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:46,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,598 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-08 14:04:46,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:04:46,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:46,654 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-08 14:04:46,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-08 14:04:46,697 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-08 14:04:46,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:46,742 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-08 14:04:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:46,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:04:46,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:46,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:04:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:04:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:46,762 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-01-08 14:04:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:47,333 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-01-08 14:04:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:47,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:04:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:47,336 INFO L225 Difference]: With dead ends: 137 [2019-01-08 14:04:47,336 INFO L226 Difference]: Without dead ends: 136 [2019-01-08 14:04:47,337 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-08 14:04:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-08 14:04:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-01-08 14:04:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 14:04:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-01-08 14:04:47,413 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-01-08 14:04:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:47,414 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-01-08 14:04:47,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:04:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-01-08 14:04:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:47,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:47,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:47,415 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-01-08 14:04:47,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:47,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:47,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:47,614 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-08 14:04:47,685 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-08 14:04:47,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:47,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:47,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:47,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:47,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:47,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:47,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:47,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:47,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:47,728 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-08 14:04:47,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:47,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:47,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,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 22 treesize of output 45 [2019-01-08 14:04:47,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:47,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,905 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-08 14:04:47,905 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,913 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,922 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,940 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:47,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:47,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,984 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-08 14:04:47,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:48,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,043 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:48,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:48,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,064 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-08 14:04:48,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-08 14:04:48,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:48,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,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-08 14:04:48,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-08 14:04:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:48,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,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 72 [2019-01-08 14:04:48,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:48,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-08 14:04:48,184 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-08 14:04:48,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:48,233 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-08 14:04:48,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:48,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:04:48,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:48,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:04:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:04:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:48,252 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-01-08 14:04:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:48,858 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-01-08 14:04:48,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:04:48,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:04:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:48,861 INFO L225 Difference]: With dead ends: 172 [2019-01-08 14:04:48,861 INFO L226 Difference]: Without dead ends: 167 [2019-01-08 14:04:48,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:04:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-08 14:04:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-01-08 14:04:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-08 14:04:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-01-08 14:04:48,921 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-01-08 14:04:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:48,921 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-01-08 14:04:48,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:04:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-01-08 14:04:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:04:48,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:48,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:04:48,922 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:48,922 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-01-08 14:04:48,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:49,048 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-08 14:04:49,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:49,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:49,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:49,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:49,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:49,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:49,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:04:49,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:04:49,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:04:49,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:49,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:49,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,087 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-08 14:04:49,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,117 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-08 14:04:49,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,148 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-08 14:04:49,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,181 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-08 14:04:49,183 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-08 14:04:49,186 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-08 14:04:49,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:49,188 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,203 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,236 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:49,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:49,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,283 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-08 14:04:49,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:49,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:49,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:49,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,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-08 14:04:49,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-08 14:04:49,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,357 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-08 14:04:49,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:49,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-08 14:04:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,405 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:49,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:49,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:49,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-01-08 14:04:49,446 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-08 14:04:49,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:49,500 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-08 14:04:49,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:49,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:04:49,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:49,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:04:49,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:04:49,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:04:49,520 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-01-08 14:04:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:49,969 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-01-08 14:04:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:04:49,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:04:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:49,971 INFO L225 Difference]: With dead ends: 140 [2019-01-08 14:04:49,971 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 14:04:49,972 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-08 14:04:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 14:04:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-01-08 14:04:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-08 14:04:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-01-08 14:04:50,030 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-01-08 14:04:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:50,030 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-01-08 14:04:50,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:04:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-01-08 14:04:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:50,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:50,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:50,031 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-08 14:04:50,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:50,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:50,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:50,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:50,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:50,191 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-08 14:04:50,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:50,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:50,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:04:50,192 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-08 14:04:50,193 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:50,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:50,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:50,195 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:50,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:50,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:50,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:50,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:50,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:50,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:50,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:50,248 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-08 14:04:50,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:50,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,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, 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-08 14:04:50,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:50,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:50,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,451 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-08 14:04:50,452 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,461 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,489 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:50,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,516 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-08 14:04:50,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,534 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-08 14:04:50,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:50,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 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-08 14:04:50,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:50,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:50,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,612 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:50,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:50,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:50,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:04:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:50,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:50,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:50,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:04:50,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:50,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:50,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:50,710 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-01-08 14:04:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:51,164 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-01-08 14:04:51,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:04:51,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:04:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:51,166 INFO L225 Difference]: With dead ends: 77 [2019-01-08 14:04:51,166 INFO L226 Difference]: Without dead ends: 76 [2019-01-08 14:04:51,167 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-08 14:04:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-08 14:04:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-01-08 14:04:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-08 14:04:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-01-08 14:04:51,231 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-01-08 14:04:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:51,231 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-01-08 14:04:51,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-01-08 14:04:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:51,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:51,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:51,232 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-08 14:04:51,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:51,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:51,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:51,391 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-08 14:04:51,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:51,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:51,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:04:51,392 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-08 14:04:51,393 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:51,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:51,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:51,396 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:04:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:51,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:51,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:51,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:51,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:51,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:51,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:51,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:51,432 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-08 14:04:51,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:04:51,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:04:51,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,525 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-08 14:04:51,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,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-08 14:04:51,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,610 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-08 14:04:51,610 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,630 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,637 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,656 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:51,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,699 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-08 14:04:51,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:51,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,728 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-08 14:04:51,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:51,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:51,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,778 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:51,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:04:51,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:51,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:04:51,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,830 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:51,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:04:51,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:51,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-08 14:04:51,874 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-08 14:04:51,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:51,916 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-08 14:04:51,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:51,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:04:51,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:51,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:04:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:04:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:51,937 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-01-08 14:04:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:52,480 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-01-08 14:04:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:04:52,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:04:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:52,482 INFO L225 Difference]: With dead ends: 86 [2019-01-08 14:04:52,482 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:04:52,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:04:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:04:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-01-08 14:04:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 14:04:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-01-08 14:04:52,573 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-01-08 14:04:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:52,573 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-01-08 14:04:52,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:04:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-01-08 14:04:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:52,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:52,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:52,574 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-01-08 14:04:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:52,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:52,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:52,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:52,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:52,702 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:04:52,703 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-01-08 14:04:52,704 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:52,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:52,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:52,707 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:52,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:52,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:52,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:52,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:52,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:52,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:52,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:52,726 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-08 14:04:52,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:52,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:52,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:52,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-01-08 14:04:52,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-01-08 14:04:52,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:04:52,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-08 14:04:52,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-01-08 14:04:52,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,827 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-08 14:04:52,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,839 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:52,840 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-08 14:04:52,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,852 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-08 14:04:52,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-01-08 14:04:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:52,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:52,883 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-08 14:04:52,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:52,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-01-08 14:04:52,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:52,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:04:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:04:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:52,902 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-01-08 14:04:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:53,127 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-01-08 14:04:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:53,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-08 14:04:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:53,130 INFO L225 Difference]: With dead ends: 115 [2019-01-08 14:04:53,130 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 14:04:53,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 14:04:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-01-08 14:04:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 14:04:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-01-08 14:04:53,245 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-01-08 14:04:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:53,246 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-01-08 14:04:53,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:04:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-01-08 14:04:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:53,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:53,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:53,247 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-08 14:04:53,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:53,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:53,623 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-08 14:04:53,777 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-08 14:04:53,807 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-08 14:04:53,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:53,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:53,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:53,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:53,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:53,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:53,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:53,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:53,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:53,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:53,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:53,840 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-08 14:04:53,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:04:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:04:53,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:53,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,927 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-08 14:04:53,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,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-08 14:04:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,999 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-08 14:04:54,000 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,008 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,035 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:54,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:54,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,080 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-08 14:04:54,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:54,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:54,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, 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-08 14:04:54,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,127 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-08 14:04:54,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-08 14:04:54,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,155 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-08 14:04:54,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:54,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-08 14:04:54,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:54,206 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-08 14:04:54,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:54,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-08 14:04:54,251 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-08 14:04:54,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:54,292 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-08 14:04:54,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:54,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:04:54,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:54,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:04:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:04:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:54,313 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-01-08 14:04:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:54,927 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-01-08 14:04:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:04:54,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:04:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:54,929 INFO L225 Difference]: With dead ends: 104 [2019-01-08 14:04:54,929 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:04:54,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:04:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:04:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-01-08 14:04:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:04:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-01-08 14:04:55,013 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-01-08 14:04:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:55,013 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-01-08 14:04:55,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:04:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-01-08 14:04:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:55,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:55,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:55,014 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:55,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-01-08 14:04:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:55,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:55,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:55,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:55,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:55,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:04:55,072 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-08 14:04:55,073 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:55,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:55,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:55,076 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:55,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:55,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:55,076 INFO 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-08 14:04:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:55,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:55,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:55,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:55,111 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-08 14:04:55,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04:55,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,129 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-08 14:04:55,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:04:55,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,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 22 treesize of output 38 [2019-01-08 14:04:55,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,225 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-08 14:04:55,225 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,241 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,258 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-08 14:04:55,258 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:04:55,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:04:55,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,298 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-08 14:04:55,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:55,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-08 14:04:55,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,331 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-08 14:04:55,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-08 14:04:55,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:55,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:55,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:55,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,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-08 14:04:55,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-01-08 14:04:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:55,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:55,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:55,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:55,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:55,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:55,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:55,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:55,439 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-01-08 14:04:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:55,846 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-01-08 14:04:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:55,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:04:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:55,848 INFO L225 Difference]: With dead ends: 68 [2019-01-08 14:04:55,848 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:04:55,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:04:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-08 14:04:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 14:04:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-01-08 14:04:56,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-01-08 14:04:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:56,008 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-01-08 14:04:56,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-01-08 14:04:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:56,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:56,009 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-08 14:04:56,009 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-01-08 14:04:56,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,227 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-08 14:04:56,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:56,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:04:56,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:56,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:04:56,229 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-01-08 14:04:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:56,389 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-01-08 14:04:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:56,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-08 14:04:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:56,390 INFO L225 Difference]: With dead ends: 54 [2019-01-08 14:04:56,390 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 14:04:56,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:04:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 14:04:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-08 14:04:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 14:04:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-01-08 14:04:56,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-01-08 14:04:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:56,493 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-01-08 14:04:56,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-01-08 14:04:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:56,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:56,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:56,494 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:56,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-08 14:04:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,590 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-08 14:04:56,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:56,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:56,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:04:56,591 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-08 14:04:56,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:56,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:56,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:56,595 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:56,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:56,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:56,595 INFO 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-08 14:04:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:56,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,641 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-08 14:04:56,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,676 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-08 14:04:56,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,721 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-08 14:04:56,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,731 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,758 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-08 14:04:56,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:04:56,763 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-08 14:04:56,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:56,782 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,049 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,147 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-08 14:04:57,148 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:57,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,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 51 [2019-01-08 14:04:57,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:57,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:57,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:57,356 INFO L303 Elim1Store]: Index analysis took 144 ms [2019-01-08 14:04:57,357 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-08 14:04:57,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:57,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-08 14:04:57,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,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, 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-08 14:04:57,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:57,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-08 14:04:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:57,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:57,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:57,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:04:57,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:57,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:57,544 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-01-08 14:04:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:57,965 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-01-08 14:04:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:04:57,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:04:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:57,967 INFO L225 Difference]: With dead ends: 78 [2019-01-08 14:04:57,967 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 14:04:57,967 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-08 14:04:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 14:04:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-01-08 14:04:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:04:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-01-08 14:04:58,086 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-01-08 14:04:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:58,087 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-01-08 14:04:58,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-01-08 14:04:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:58,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:58,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:58,087 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-01-08 14:04:58,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:58,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:58,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:58,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:58,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:04:58,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:58,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:58,197 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:04:58,198 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-08 14:04:58,199 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:58,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:58,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:58,202 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:58,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:58,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:58,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:58,202 INFO 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-08 14:04:58,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:58,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:58,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:58,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,240 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-08 14:04:58,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-08 14:04:58,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,304 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-08 14:04:58,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,341 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-08 14:04:58,344 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-08 14:04:58,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:04: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-08 14:04:58,349 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,365 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,375 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,402 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-08 14:04:58,403 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:04:58,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,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 51 [2019-01-08 14:04:58,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:58,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:04:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,474 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-08 14:04:58,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:58,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:04:58,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-08 14:04:58,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:58,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:58,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:58,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:58,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:58,555 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-01-08 14:04:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:59,051 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-01-08 14:04:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:59,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:04:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:59,052 INFO L225 Difference]: With dead ends: 64 [2019-01-08 14:04:59,052 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 14:04:59,053 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-08 14:04:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 14:04:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-08 14:04:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 14:04:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-01-08 14:04:59,178 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-01-08 14:04:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:59,178 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-01-08 14:04:59,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-01-08 14:04:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:04:59,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:59,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:04:59,179 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-08 14:04:59,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:59,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:59,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:59,260 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-08 14:04:59,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:59,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:59,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:59,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:59,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:59,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:04:59,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:59,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:59,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:04:59,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:59,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:59,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-08 14:04:59,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,333 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-08 14:04:59,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:04:59,421 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-08 14:04:59,424 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-08 14:04:59,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:59,429 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,444 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,477 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-08 14:04:59,477 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:04:59,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:04:59,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,522 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-08 14:04:59,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:04:59,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,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 28 treesize of output 50 [2019-01-08 14:04:59,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,557 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-08 14:04:59,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-08 14:04:59,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,580 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:59,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:04:59,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:59,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-08 14:04:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:59,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:59,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:59,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:59,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:59,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:59,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:59,674 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-01-08 14:05:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:00,142 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-01-08 14:05:00,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:00,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:05:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:00,144 INFO L225 Difference]: With dead ends: 76 [2019-01-08 14:05:00,144 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:05:00,145 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-08 14:05:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:05:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-01-08 14:05:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:05:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-01-08 14:05:00,299 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-01-08 14:05:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:00,299 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-01-08 14:05:00,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-01-08 14:05:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:00,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:00,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:00,300 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-01-08 14:05:00,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:00,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:00,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:00,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:00,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:00,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:00,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:00,450 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-01-08 14:05:00,451 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:00,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:00,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:00,454 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:05:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:00,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:00,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,455 INFO 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-08 14:05:00,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:00,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:00,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:00,478 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-08 14:05:00,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,502 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-08 14:05:00,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,526 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:00,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:00,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:05:00,557 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-08 14:05:00,558 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,569 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,598 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-08 14:05:00,599 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-08 14:05:00,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:00,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:00,667 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-08 14:05:00,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-08 14:05:00,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:00,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:00,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:00,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,743 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-08 14:05:00,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-08 14:05:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:00,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:00,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:00,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-08 14:05:00,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:00,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:00,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:00,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:00,812 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-01-08 14:05:01,348 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-01-08 14:05:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:01,984 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-01-08 14:05:01,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:05:01,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:05:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:01,986 INFO L225 Difference]: With dead ends: 90 [2019-01-08 14:05:01,986 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 14:05:01,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:05:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 14:05:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-01-08 14:05:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 14:05:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-01-08 14:05:02,206 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-01-08 14:05:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:02,207 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-01-08 14:05:02,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-01-08 14:05:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:05:02,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:02,207 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:02,207 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:02,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-01-08 14:05:02,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:02,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:02,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:02,358 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-08 14:05:02,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:02,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:02,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:05:02,359 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-08 14:05:02,359 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:02,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:02,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:02,362 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:05:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:02,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:02,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:02,363 INFO 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-08 14:05:02,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:02,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:02,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:02,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, 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-08 14:05:02,396 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-08 14:05:02,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:05:02,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:05:02,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,472 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-08 14:05:02,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,499 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-08 14:05:02,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,530 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-08 14:05:02,530 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,540 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,548 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:02,566 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:05:02,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,585 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-08 14:05:02,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:02,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:02,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,626 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-08 14:05:02,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:02,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:05:02,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:02,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:02,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:05:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:02,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:02,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:02,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-08 14:05:02,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:02,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:05:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:05:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:02,772 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-01-08 14:05:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:03,454 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-01-08 14:05:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:05:03,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:05:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:03,456 INFO L225 Difference]: With dead ends: 118 [2019-01-08 14:05:03,456 INFO L226 Difference]: Without dead ends: 106 [2019-01-08 14:05:03,456 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-08 14:05:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-08 14:05:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-01-08 14:05:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-08 14:05:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-01-08 14:05:03,691 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-01-08 14:05:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:03,692 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-01-08 14:05:03,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:05:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-01-08 14:05:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:05:03,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:03,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:03,692 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-01-08 14:05:03,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:03,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:03,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:03,830 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-08 14:05:03,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:03,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:03,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:05:03,831 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-01-08 14:05:03,832 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:03,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:03,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:03,834 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:03,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:03,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:03,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:03,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:03,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:03,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:03,873 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-08 14:05:03,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:05:03,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:03,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,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-08 14:05:03,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,942 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-08 14:05:03,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,968 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-08 14:05:03,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,998 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-08 14:05:03,999 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,008 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,034 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:05:04,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:05:04,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:04,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:04,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:04,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:04,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:05:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:04,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:04,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:04,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-08 14:05:04,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,367 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:04,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:04,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:04,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-08 14:05:04,413 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-08 14:05:04,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:04,458 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-08 14:05:04,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:04,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-08 14:05:04,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:04,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:05:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:05:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:04,477 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-01-08 14:05:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:05,363 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-01-08 14:05:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:05:05,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-08 14:05:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:05,364 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:05:05,364 INFO L226 Difference]: Without dead ends: 119 [2019-01-08 14:05:05,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:05:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-08 14:05:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-01-08 14:05:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 14:05:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-01-08 14:05:05,674 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-01-08 14:05:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:05,674 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-01-08 14:05:05,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:05:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-01-08 14:05:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:05:05,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:05,675 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:05,675 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:05,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:05,676 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-01-08 14:05:05,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:05,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:05,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:05,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:05,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:05,795 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-08 14:05:05,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:05,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:05,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:05:05,796 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-01-08 14:05:05,797 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:05,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:05,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:05,800 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:05:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:05,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:05,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:05,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:05:05,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:05,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:05,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:05,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:05,822 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-08 14:05:05,828 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-08 14:05:05,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,840 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-08 14:05:05,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-08 14:05:05,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:05,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,900 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-08 14:05:05,900 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,906 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,925 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-08 14:05:05,925 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-08 14:05:05,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:05:05,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:05,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-08 14:05:05,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-08 14:05:06,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,020 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-08 14:05:06,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:05:06,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,075 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-08 14:05:06,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-01-08 14:05:06,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:06,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:05:06,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-08 14:05:06,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-01-08 14:05:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:06,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:06,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:06,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:05:06,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:06,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:05:06,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:05:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:06,424 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-01-08 14:05:06,761 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-01-08 14:05:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:07,268 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-01-08 14:05:07,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:07,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:05:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:07,270 INFO L225 Difference]: With dead ends: 87 [2019-01-08 14:05:07,270 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:05:07,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:05:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-08 14:05:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 14:05:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-01-08 14:05:07,617 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-01-08 14:05:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:07,617 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-01-08 14:05:07,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:05:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-01-08 14:05:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:05:07,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:07,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:07,618 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:07,618 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-01-08 14:05:07,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:07,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:07,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:07,796 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-08 14:05:07,887 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-08 14:05:07,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:07,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:07,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:07,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,888 INFO 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-08 14:05:07,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:07,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:07,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:07,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:07,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:07,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:07,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:05:07,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,921 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-08 14:05:07,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,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, 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-08 14:05:07,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:05:07,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:05:08,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,019 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-08 14:05:08,020 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,028 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,053 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-01-08 14:05:08,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:08,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:05:08,188 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-08 14:05:08,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-01-08 14:05:08,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:08,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,306 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:08,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:08,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,335 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-08 14:05:08,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-01-08 14:05:08,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:08,387 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-08 14:05:08,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,430 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-08 14:05:08,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,457 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-08 14:05:08,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-01-08 14:05:08,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:05:08,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,552 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:08,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-08 14:05:08,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,588 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-08 14:05:08,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-01-08 14:05:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:08,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:08,681 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-08 14:05:08,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:08,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-08 14:05:08,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:08,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:05:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:05:08,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:08,702 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-01-08 14:05:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:10,044 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-01-08 14:05:10,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:05:10,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-08 14:05:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:10,046 INFO L225 Difference]: With dead ends: 186 [2019-01-08 14:05:10,047 INFO L226 Difference]: Without dead ends: 177 [2019-01-08 14:05:10,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:05:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-08 14:05:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-01-08 14:05:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 14:05:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-01-08 14:05:10,490 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-01-08 14:05:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:10,490 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-01-08 14:05:10,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:05:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-01-08 14:05:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:05:10,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:10,491 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:10,491 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-01-08 14:05:10,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:10,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:10,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:10,665 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-08 14:05:10,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:10,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:10,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:05:10,666 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-08 14:05:10,668 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:10,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:10,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:10,671 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:10,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:10,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:10,672 INFO 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-08 14:05:10,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:10,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:10,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:10,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-08 14:05:10,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,733 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-08 14:05:10,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,765 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-08 14:05:10,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 14:05:10,799 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-08 14:05:10,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, 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-08 14:05:10,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:05:10,805 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,819 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,855 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-08 14:05:10,855 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:05:10,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:05:10,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:10,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:10,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,924 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-08 14:05:10,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:10,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:05:10,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,976 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:10,976 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-08 14:05:10,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:11,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-08 14:05:11,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:11,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:11,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-08 14:05:11,091 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-08 14:05:11,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:11,136 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-08 14:05:11,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:11,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:05:11,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:11,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:11,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:11,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:11,159 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-01-08 14:05:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:12,031 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-01-08 14:05:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:05:12,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:05:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:12,035 INFO L225 Difference]: With dead ends: 110 [2019-01-08 14:05:12,035 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:05:12,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:05:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:05:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-01-08 14:05:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:05:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-08 14:05:12,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-01-08 14:05:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:12,155 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-08 14:05:12,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-08 14:05:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:05:12,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:12,156 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:12,156 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-01-08 14:05:12,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:12,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:12,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:12,270 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-08 14:05:12,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:12,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:12,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:12,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:12,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:12,271 INFO 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-08 14:05:12,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:05:12,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:05:12,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:05:12,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:12,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:12,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,313 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-08 14:05:12,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,342 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-08 14:05:12,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,375 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-08 14:05:12,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,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, 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-08 14:05:12,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, 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-08 14:05:12,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:05:12,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:05:12,417 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,465 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:05:12,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,494 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-08 14:05:12,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,517 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-08 14:05:12,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:05:12,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,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, 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-08 14:05:12,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,566 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-08 14:05:12,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-01-08 14:05:12,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,595 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:12,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 77 [2019-01-08 14:05:12,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,621 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-08 14:05:12,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-01-08 14:05:12,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:05:12,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:12,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-01-08 14:05:12,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,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 35 treesize of output 59 [2019-01-08 14:05:12,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:12,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-01-08 14:05:12,750 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-08 14:05:12,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:12,823 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-08 14:05:12,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:12,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-08 14:05:12,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:12,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:05:12,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:05:12,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:05:12,845 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-01-08 14:05:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:13,348 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-01-08 14:05:13,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:05:13,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-08 14:05:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:13,349 INFO L225 Difference]: With dead ends: 32 [2019-01-08 14:05:13,349 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:05:13,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:05:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:05:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:05:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:05:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:05:13,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-08 14:05:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:13,350 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:05:13,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:05:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:05:13,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:05:13,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:05:13,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:13,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:13,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:13,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:13,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:13,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:13,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:14,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:15,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:15,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:17,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:18,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:18,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:22,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:05:24,808 WARN L181 SmtUtils]: Spent 11.45 s on a formula simplification. DAG size of input: 1504 DAG size of output: 1059 [2019-01-08 14:05:42,041 WARN L181 SmtUtils]: Spent 17.22 s on a formula simplification. DAG size of input: 996 DAG size of output: 75 [2019-01-08 14:05:42,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:05:42,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-01-08 14:05:42,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-08 14:05:42,045 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-08 14:05:42,045 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-08 14:05:42,045 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-08 14:05:42,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:05:42,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-01-08 14:05:42,046 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-01-08 14:05:42,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-08 14:05:42,046 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-08 14:05:42,066 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:05:42 BoogieIcfgContainer [2019-01-08 14:05:42,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:05:42,067 INFO L168 Benchmark]: Toolchain (without parser) took 97170.41 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-01-08 14:05:42,067 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:05:42,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:05:42,068 INFO L168 Benchmark]: Boogie Preprocessor took 24.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:05:42,068 INFO L168 Benchmark]: RCFGBuilder took 431.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:05:42,068 INFO L168 Benchmark]: TraceAbstraction took 96653.88 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-01-08 14:05:42,070 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 431.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96653.88 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - 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 - 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, 96.5s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 28.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 352 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4079744448 FormulaSimplificationTreeSizeReduction, 11.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39947544 FormulaSimplificationTreeSizeReductionInter, 17.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 35.5s 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...