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-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:10:26,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:10:26,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:10:26,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:10:26,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:10:26,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:10:26,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:10:26,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:10:26,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:10:26,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:10:26,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:10:26,693 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:10:26,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:10:26,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:10:26,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:10:26,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:10:26,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:10:26,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:10:26,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:10:26,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:10:26,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:10:26,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:10:26,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:10:26,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:10:26,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:10:26,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:10:26,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:10:26,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:10:26,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:10:26,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:10:26,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:10:26,722 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:10:26,722 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:10:26,722 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:10:26,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:10:26,724 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:10:26,724 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:10:26,736 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:10:26,736 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:10:26,737 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:10:26,737 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:10:26,737 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:10:26,738 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:10:26,738 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:10:26,738 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:10:26,738 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:10:26,738 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:10:26,738 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:10:26,739 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:10:26,739 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:10:26,739 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:10:26,740 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:10:26,740 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:10:26,740 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:10:26,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:10:26,740 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:10:26,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:10:26,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:10:26,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:10:26,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:10:26,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:10:26,741 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:10:26,742 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:10:26,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:10:26,742 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:10:26,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:10:26,742 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:10:26,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:10:26,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:10:26,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:10:26,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:10:26,743 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:10:26,744 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:10:26,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:10:26,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:10:26,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:10:26,744 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:10:26,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:10:26,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:10:26,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:10:26,800 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:10:26,801 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:10:26,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-01-11 11:10:26,802 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-11 11:10:26,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:10:26,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:10:26,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:10:26,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:10:26,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:10:26,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:10:26,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:10:26,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:10:26,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:10:26,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... [2019-01-11 11:10:26,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:10:26,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:10:26,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:10:26,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:10:26,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:10:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:10:26,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:10:27,261 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:10:27,262 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-11 11:10:27,263 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:10:27 BoogieIcfgContainer [2019-01-11 11:10:27,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:10:27,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:10:27,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:10:27,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:10:27,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:10:26" (1/2) ... [2019-01-11 11:10:27,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697c9d87 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:10:27, skipping insertion in model container [2019-01-11 11:10:27,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:10:27" (2/2) ... [2019-01-11 11:10:27,272 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-11 11:10:27,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:10:27,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-11 11:10:27,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-11 11:10:27,347 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:10:27,347 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:10:27,348 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:10:27,348 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:10:27,348 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:10:27,348 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:10:27,348 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:10:27,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:10:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-11 11:10:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:10:27,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:27,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:10:27,375 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-11 11:10:27,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:27,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:27,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:27,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:27,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:27,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:10:27,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:10:27,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:10:27,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:10:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:10:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:10:27,588 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-11 11:10:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:27,841 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-11 11:10:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:10:27,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:10:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:27,856 INFO L225 Difference]: With dead ends: 17 [2019-01-11 11:10:27,857 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 11:10:27,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:10:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 11:10:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-11 11:10:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 11:10:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-11 11:10:27,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-11 11:10:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:27,897 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-11 11:10:27,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:10:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-11 11:10:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:10:27,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:27,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:10:27,899 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-11 11:10:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:27,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:27,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:27,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:10:27,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:10:27,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:10:27,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:10:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:10:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:10:27,988 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-11 11:10:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:28,179 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-11 11:10:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:10:28,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 11:10:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:28,181 INFO L225 Difference]: With dead ends: 12 [2019-01-11 11:10:28,181 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:10:28,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:10:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:10:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-11 11:10:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 11:10:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-11 11:10:28,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-11 11:10:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:28,186 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-11 11:10:28,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:10:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-11 11:10:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:10:28,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:28,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:10:28,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-11 11:10:28,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:28,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:28,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:28,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:28,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:28,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:28,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:10:28,257 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-11 11:10:28,297 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:28,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:28,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:28,394 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:10:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:28,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:28,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:28,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:28,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:28,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:28,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:28,512 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 12 treesize of output 15 [2019-01-11 11:10:28,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:28,550 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 15 treesize of output 21 [2019-01-11 11:10:28,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:28,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:28,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:28,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:28,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:28,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:28,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:28,841 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:28,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:28,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:28,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,021 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-11 11:10: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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:10:29,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:29,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:29,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:29,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-11 11:10:29,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:29,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:10:29,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:10:29,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:10:29,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:10:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:10:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:10:29,261 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-11 11:10:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:29,345 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-11 11:10:29,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:10:29,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:10:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:29,348 INFO L225 Difference]: With dead ends: 13 [2019-01-11 11:10:29,348 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 11:10:29,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:10:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 11:10:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-11 11:10:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:10:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-11 11:10:29,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-11 11:10:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:29,355 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-11 11:10:29,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:10:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-11 11:10:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:10:29,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:29,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:10:29,357 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-11 11:10:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:29,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:29,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:29,527 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-11 11:10:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:29,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:29,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:29,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:10:29,537 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-11 11:10:29,540 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:29,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:29,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:29,548 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:10:29,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:29,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:29,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:29,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:29,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:29,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:29,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:29,572 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 12 treesize of output 15 [2019-01-11 11:10:29,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,579 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 15 treesize of output 21 [2019-01-11 11:10:29,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,609 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:29,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:29,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:29,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:29,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:29,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:29,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:29,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:10:29,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:29,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:29,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:29,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:10:29,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:29,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:10:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:10:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:10:29,892 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-11 11:10:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:30,396 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-11 11:10:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:10:30,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:10:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:30,398 INFO L225 Difference]: With dead ends: 24 [2019-01-11 11:10:30,398 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 11:10:30,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:10:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 11:10:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-11 11:10:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:10:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-11 11:10:30,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-11 11:10:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:30,404 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-11 11:10:30,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:10:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-11 11:10:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:10:30,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:30,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:10:30,405 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-11 11:10:30,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:30,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:30,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:30,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:10:30,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:10:30,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:10:30,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:10:30,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:10:30,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:10:30,433 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-11 11:10:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:30,476 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-11 11:10:30,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:10:30,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 11:10:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:30,477 INFO L225 Difference]: With dead ends: 15 [2019-01-11 11:10:30,478 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 11:10:30,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:10:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 11:10:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 11:10:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:10:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-11 11:10:30,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-11 11:10:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:30,488 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-11 11:10:30,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:10:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-11 11:10:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:10:30,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:30,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:10:30,489 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-11 11:10:30,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:30,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:30,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:30,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:30,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:30,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:10:30,588 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-11 11:10:30,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:30,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:30,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:30,678 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:10:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:30,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:30,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:30,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:30,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:30,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:30,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 11:10:30,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:30,713 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 15 treesize of output 21 [2019-01-11 11:10:30,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:30,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:30,734 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:30,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:30,782 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:30,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:30,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:30,807 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:30,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:30,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:30,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:30,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:30,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:10:30,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:30,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:30,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:30,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:30,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:30,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:10:30,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:30,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:10:30,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:10:30,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:10:30,952 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-11 11:10:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:31,106 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-11 11:10:31,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:10:31,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:10:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:31,107 INFO L225 Difference]: With dead ends: 21 [2019-01-11 11:10:31,107 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:10:31,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:10:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:10:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-11 11:10:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 11:10:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-11 11:10:31,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-11 11:10:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:31,113 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-11 11:10:31,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:10:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-11 11:10:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:10:31,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:31,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:10:31,114 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-11 11:10:31,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:31,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:31,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:31,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:31,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:31,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:31,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:31,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:10:31,222 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-11 11:10:31,225 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:31,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:31,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:31,230 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:10:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:31,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:31,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:31,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:31,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:31,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:31,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:31,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 11:10:31,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,258 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 15 treesize of output 21 [2019-01-11 11:10:31,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:31,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,290 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,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-11 11:10:31,331 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:31,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:10:31,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:31,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:31,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:10:31,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:31,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:31,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:31,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:31,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:10:31,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:31,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:10:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:10:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:10:31,553 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-11 11:10:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:31,814 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-11 11:10:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:10:31,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:10:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:31,815 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:10:31,816 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 11:10:31,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:10:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 11:10:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-11 11:10:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 11:10:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-11 11:10:31,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-11 11:10:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:31,823 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-11 11:10:31,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:10:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-11 11:10:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:10:31,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:31,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:10:31,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-11 11:10:31,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:31,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:31,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:31,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:31,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:31,854 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:10:31,854 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-11 11:10:31,856 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:31,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:31,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:31,861 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:10:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:31,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:31,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:31,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:31,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:31,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:31,894 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 12 treesize of output 15 [2019-01-11 11:10:31,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17 [2019-01-11 11:10:31,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:31,912 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 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 11:10:31,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:31,994 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2019-01-11 11:10:32,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 11:10:32,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:32,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:32,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 11:10:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:10:32,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:10:32,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:10:32,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:10:32,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:10:32,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:10:32,093 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-11 11:10:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:32,142 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-11 11:10:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:10:32,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:10:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:32,144 INFO L225 Difference]: With dead ends: 30 [2019-01-11 11:10:32,144 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 11:10:32,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:10:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 11:10:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-11 11:10:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:10:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-11 11:10:32,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-11 11:10:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:32,154 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-11 11:10:32,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:10:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-11 11:10:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:10:32,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:32,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:10:32,155 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-11 11:10:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:32,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:32,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:32,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:10:32,273 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-11 11:10:32,275 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:32,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:32,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:32,280 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:10:32,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:32,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:32,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:32,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:32,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:32,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:32,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:32,308 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 12 treesize of output 15 [2019-01-11 11:10:32,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,318 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 15 treesize of output 21 [2019-01-11 11:10:32,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,324 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:32,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:32,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:32,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:32,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:32,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:32,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:10:32,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:32,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:32,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:32,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:10:32,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:32,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:32,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:10:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:32,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:10:32,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:32,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:10:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:10:32,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:10:32,580 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-11 11:10:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:32,880 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2019-01-11 11:10:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:10:32,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:10:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:32,882 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:10:32,882 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 11:10:32,883 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-11 11:10:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 11:10:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-01-11 11:10:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:10:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-11 11:10:32,892 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-11 11:10:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:32,892 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-11 11:10:32,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:10:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-11 11:10:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:10:32,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:32,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:10:32,894 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-11 11:10:32,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:32,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:32,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:32,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:10:32,949 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-11 11:10:32,950 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:32,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:32,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:32,955 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:10:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:32,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:32,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:32,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:32,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:32,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:32,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:32,979 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 12 treesize of output 15 [2019-01-11 11:10:32,983 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 15 treesize of output 17 [2019-01-11 11:10:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:32,998 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 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 11:10:32,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:33,066 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-11 11:10:33,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:10:33,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:33,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 11:10:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:33,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:33,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:33,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:10:33,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:33,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:10:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:10:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:10:33,150 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-11 11:10:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:33,247 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2019-01-11 11:10:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:10:33,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:10:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:33,252 INFO L225 Difference]: With dead ends: 38 [2019-01-11 11:10:33,252 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:10:33,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:10:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:10:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-01-11 11:10:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:10:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-11 11:10:33,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-11 11:10:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:33,261 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-11 11:10:33,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:10:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-11 11:10:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:10:33,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:33,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:10:33,262 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-11 11:10:33,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:33,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:33,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:33,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:33,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:33,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:10:33,326 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-11 11:10:33,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:33,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:33,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:33,332 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:10:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:33,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:33,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:33,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:33,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:33,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:33,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:33,354 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 12 treesize of output 15 [2019-01-11 11:10:33,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,395 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 15 treesize of output 21 [2019-01-11 11:10:33,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,452 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:33,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,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 1 xjuncts. [2019-01-11 11:10:33,667 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:33,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:33,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:10:33,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:33,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:33,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:33,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:10:33,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:10:33,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:10:33,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:10:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:10:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:10:33,895 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2019-01-11 11:10:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:34,008 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2019-01-11 11:10:34,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:10:34,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:10:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:34,009 INFO L225 Difference]: With dead ends: 38 [2019-01-11 11:10:34,009 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 11:10:34,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:10:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 11:10:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-11 11:10:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 11:10:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2019-01-11 11:10:34,019 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2019-01-11 11:10:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:34,019 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2019-01-11 11:10:34,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:10:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2019-01-11 11:10:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:10:34,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:34,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:10:34,021 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:34,021 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-11 11:10:34,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:34,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:34,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:10:34,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:34,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:34,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:10:34,144 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-11 11:10:34,147 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:34,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:34,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:34,156 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:10:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:34,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:34,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:34,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:34,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:34,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:34,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:34,174 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 12 treesize of output 15 [2019-01-11 11:10:34,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,185 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 15 treesize of output 21 [2019-01-11 11:10:34,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,195 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:34,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:34,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:10:34,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:34,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,379 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:10:34,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:10:34,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:34,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:34,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:34,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:34,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:10:34,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:34,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:10:34,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:10:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:10:34,600 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2019-01-11 11:10:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:34,774 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2019-01-11 11:10:34,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:10:34,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:10:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:34,776 INFO L225 Difference]: With dead ends: 37 [2019-01-11 11:10:34,776 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 11:10:34,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:10:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 11:10:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-01-11 11:10:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:10:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2019-01-11 11:10:34,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2019-01-11 11:10:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:34,786 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2019-01-11 11:10:34,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:10:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2019-01-11 11:10:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:10:34,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:34,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:10:34,787 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-11 11:10:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:34,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:34,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:34,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:34,875 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:10:34,876 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-11 11:10:34,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:34,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:34,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:34,883 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:10:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:34,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:34,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:34,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:34,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:34,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:34,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 12 treesize of output 15 [2019-01-11 11:10:34,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 11:10:34,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:34,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:34,947 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:34,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:34,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:10:34,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:34,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:34,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:35,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:10:35,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:35,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:35,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:10:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:35,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:35,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:35,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:10:35,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:35,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:10:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:10:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:10:35,103 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2019-01-11 11:10:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:35,528 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-01-11 11:10:35,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:10:35,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:10:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:35,529 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:10:35,529 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:10:35,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:10:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:10:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-11 11:10:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:10:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-01-11 11:10:35,539 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-01-11 11:10:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:35,540 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-01-11 11:10:35,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:10:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-01-11 11:10:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:10:35,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:35,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:10:35,541 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-11 11:10:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:35,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:35,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:35,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:35,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:35,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:10:35,723 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-11 11:10:35,725 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:35,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:35,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:35,733 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:10:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:35,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:35,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:35,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:35,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:35,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:35,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:35,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 11:10:35,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17 [2019-01-11 11:10:35,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,768 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 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 11:10:35,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:35,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:35,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:35,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:35,823 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-11 11:10:35,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 11:10:35,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:35,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:35,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 11:10:35,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:35,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:10:35,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:35,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:35,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-11 11:10:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:35,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:35,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:35,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:10:35,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:35,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:10:35,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:10:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:10:35,992 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2019-01-11 11:10:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:36,231 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-01-11 11:10:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:10:36,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:10:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:36,233 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:10:36,233 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:10:36,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:10:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:10:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-11 11:10:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:10:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-01-11 11:10:36,243 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-01-11 11:10:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:36,244 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-01-11 11:10:36,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:10:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-01-11 11:10:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:10:36,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:36,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:10:36,245 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-11 11:10:36,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:36,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:36,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:36,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:36,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:36,437 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-11 11:10:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:36,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:36,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:36,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:10:36,529 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-11 11:10:36,531 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:36,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:36,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:36,535 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:10:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:36,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:36,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:36,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:36,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:36,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:36,552 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 12 treesize of output 15 [2019-01-11 11:10:36,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 11:10:36,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,580 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:36,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:36,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:36,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:36,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:36,613 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:36,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:10:36,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:36,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:36,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:36,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,681 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:10:36,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:10:36,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:36,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:36,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:36,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:36,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:10:36,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:36,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-11 11:10:36,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:36,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:10:36,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:36,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:10:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:10:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:10:36,824 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2019-01-11 11:10:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:37,237 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2019-01-11 11:10:37,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:10:37,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:10:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:37,238 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:10:37,238 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:10:37,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:10:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:10:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2019-01-11 11:10:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:10:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-11 11:10:37,248 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-11 11:10:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:37,248 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-11 11:10:37,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:10:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-11 11:10:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:10:37,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:37,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:10:37,249 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:37,249 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-11 11:10:37,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:37,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:37,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:10:37,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:37,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:37,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:10:37,380 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-11 11:10:37,383 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:37,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:37,387 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:37,387 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:10:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:37,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:37,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:37,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:37,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:37,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:37,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:37,440 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 12 treesize of output 15 [2019-01-11 11:10:37,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2019-01-11 11:10:37,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,490 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:37,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:37,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:37,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:37,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:37,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:37,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:10:37,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:37,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:37,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:37,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:37,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:10:37,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:37,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-11 11:10:37,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:37,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:37,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:37,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:10:37,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:37,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:10:37,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:10:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:10:37,655 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2019-01-11 11:10:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:37,797 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2019-01-11 11:10:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:10:37,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:10:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:37,798 INFO L225 Difference]: With dead ends: 29 [2019-01-11 11:10:37,798 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:10:37,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:10:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:10:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-11 11:10:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 11:10:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2019-01-11 11:10:37,807 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2019-01-11 11:10:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:37,808 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2019-01-11 11:10:37,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:10:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-01-11 11:10:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:10:37,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:37,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:10:37,809 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-11 11:10:37,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:37,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:37,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:10:37,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:37,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:37,990 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:10:37,990 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-11 11:10:37,991 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:37,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:37,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:37,995 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:10:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:37,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:37,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:37,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:38,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:38,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:38,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:38,013 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 12 treesize of output 15 [2019-01-11 11:10:38,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2019-01-11 11:10:38,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,033 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 11:10:38,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,062 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-11 11:10:38,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:10:38,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:38,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:38,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:10:38,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:38,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:10:38,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,295 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:10:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:10:38,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,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-11 11:10:38,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:10:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:38,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:38,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:38,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:10:38,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:38,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:10:38,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:10:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:10:38,400 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2019-01-11 11:10:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:38,637 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2019-01-11 11:10:38,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:10:38,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:10:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:38,638 INFO L225 Difference]: With dead ends: 27 [2019-01-11 11:10:38,638 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 11:10:38,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:10:38,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 11:10:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2019-01-11 11:10:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 11:10:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-11 11:10:38,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2019-01-11 11:10:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:38,644 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2019-01-11 11:10:38,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:10:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2019-01-11 11:10:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:10:38,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:38,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:10:38,645 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2019-01-11 11:10:38,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:38,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:38,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:38,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:10:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:38,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:38,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:10:38,754 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2019-01-11 11:10:38,755 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:10:38,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:10:38,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:10:38,759 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:10:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:38,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:10:38,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:38,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:38,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:38,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:38,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:38,787 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 12 treesize of output 15 [2019-01-11 11:10:38,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17 [2019-01-11 11:10:38,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 11:10:38,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:38,826 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-11 11:10:38,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 11:10:38,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:38,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 11:10:38,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:10:38,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:10:38,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:38,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:10:38,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-11 11:10:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:38,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:38,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:38,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:10:38,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:38,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:10:38,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:10:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:10:38,998 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2019-01-11 11:10:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:39,366 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2019-01-11 11:10:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:10:39,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:10:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:39,367 INFO L225 Difference]: With dead ends: 14 [2019-01-11 11:10:39,367 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 11:10:39,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:10:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 11:10:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 11:10:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 11:10:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 11:10:39,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-11 11:10:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:39,369 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 11:10:39,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:10:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 11:10:39,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 11:10:39,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 11:10:39,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:10:39,533 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2019-01-11 11:10:40,963 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2019-01-11 11:10:40,966 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 11:10:40,966 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-01-11 11:10:40,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-11 11:10:40,967 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (let ((.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse0 (<= 0 .cse5)) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p2)) (.cse3 (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3)) (.cse4 (= 0 .cse2))) (or (and .cse0 (or (and (<= .cse1 0) (<= 1 .cse2)) (and (<= (+ .cse1 1) 0) .cse3 .cse4))) (and .cse0 (= 0 .cse1) .cse3 .cse4)))) [2019-01-11 11:10:40,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 11:10:40,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-11 11:10:40,967 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-01-11 11:10:40,967 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-11 11:10:40,967 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-11 11:10:40,977 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 11:10:40 BoogieIcfgContainer [2019-01-11 11:10:40,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 11:10:40,978 INFO L168 Benchmark]: Toolchain (without parser) took 14135.84 ms. Allocated memory was 137.9 MB in the beginning and 338.7 MB in the end (delta: 200.8 MB). Free memory was 105.5 MB in the beginning and 159.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 147.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:10:40,978 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:10:40,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.35 ms. Allocated memory is still 137.9 MB. Free memory was 105.3 MB in the beginning and 103.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:10:40,979 INFO L168 Benchmark]: Boogie Preprocessor took 22.07 ms. Allocated memory is still 137.9 MB. Free memory was 103.2 MB in the beginning and 101.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:10:40,979 INFO L168 Benchmark]: RCFGBuilder took 341.66 ms. Allocated memory is still 137.9 MB. Free memory was 101.9 MB in the beginning and 92.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-01-11 11:10:40,980 INFO L168 Benchmark]: TraceAbstraction took 13712.72 ms. Allocated memory was 137.9 MB in the beginning and 338.7 MB in the end (delta: 200.8 MB). Free memory was 91.8 MB in the beginning and 159.0 MB in the end (delta: -67.2 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. [2019-01-11 11:10:40,982 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 137.9 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.35 ms. Allocated memory is still 137.9 MB. Free memory was 105.3 MB in the beginning and 103.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.07 ms. Allocated memory is still 137.9 MB. Free memory was 103.2 MB in the beginning and 101.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 341.66 ms. Allocated memory is still 137.9 MB. Free memory was 101.9 MB in the beginning and 92.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13712.72 ms. Allocated memory was 137.9 MB in the beginning and 338.7 MB in the end (delta: 200.8 MB). Free memory was 91.8 MB in the beginning and 159.0 MB in the end (delta: -67.2 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 <= #memory_int[p3] && ((#memory_int[p3 := #memory_int[p3] + 1][p2] <= 0 && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (((0 <= #memory_int[p3] && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 13.6s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 127 SDslu, 1 SDs, 0 SdLazy, 1173 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 15 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 100 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5245 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 4723 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 168 ConstructedInterpolants, 45 QuantifiedInterpolants, 9722 SizeOfPredicates, 30 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 25/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...