java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:51:49,692 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:51:49,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:51:49,706 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:51:49,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:51:49,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:51:49,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:51:49,711 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:51:49,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:51:49,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:51:49,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:51:49,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:51:49,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:51:49,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:51:49,718 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:51:49,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:51:49,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:51:49,721 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:51:49,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:51:49,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:51:49,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:51:49,728 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:51:49,730 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:51:49,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:51:49,731 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:51:49,732 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:51:49,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:51:49,734 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:51:49,735 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:51:49,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:51:49,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:51:49,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:51:49,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:51:49,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:51:49,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:51:49,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:51:49,739 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:51:49,762 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:51:49,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:51:49,764 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:51:49,764 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:51:49,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:51:49,765 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:51:49,765 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:51:49,765 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:51:49,765 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:51:49,765 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:51:49,766 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:51:49,766 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:51:49,767 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:51:49,767 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:51:49,767 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:51:49,769 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:51:49,769 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:51:49,769 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:51:49,769 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:51:49,770 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:51:49,770 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:51:49,770 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:51:49,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:51:49,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:51:49,770 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:51:49,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:51:49,772 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:51:49,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:51:49,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:51:49,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:51:49,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:51:49,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:51:49,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:51:49,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:51:49,774 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:51:49,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:51:49,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:51:49,774 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:51:49,775 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:51:49,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:51:49,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:51:49,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:51:49,843 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:51:49,843 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:51:49,844 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2019-02-28 10:51:49,845 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-02-28 10:51:49,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:51:49,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:51:49,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:51:49,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:51:49,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:51:49,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:51:49,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:51:49,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:51:49,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:51:49,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/1) ... [2019-02-28 10:51:49,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:51:49,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:51:49,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:51:49,957 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:51:49,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:51:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:51:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:51:50,278 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:51:50,278 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-28 10:51:50,279 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:51:50 BoogieIcfgContainer [2019-02-28 10:51:50,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:51:50,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:51:50,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:51:50,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:51:50,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:51:49" (1/2) ... [2019-02-28 10:51:50,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f97e17 and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:51:50, skipping insertion in model container [2019-02-28 10:51:50,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:51:50" (2/2) ... [2019-02-28 10:51:50,286 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-02-28 10:51:50,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:51:50,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:51:50,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:51:50,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:51:50,340 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:51:50,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:51:50,340 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:51:50,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:51:50,341 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:51:50,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:51:50,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:51:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:51:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:51:50,362 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:50,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:51:50,365 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-28 10:51:50,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:50,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:50,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:50,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:51:50,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:51:50,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:51:50,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:51:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:51:50,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:51:50,556 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:51:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:50,727 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-28 10:51:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:51:50,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:51:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:50,746 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:51:50,746 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:51:50,750 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-02-28 10:51:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:51:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-28 10:51:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:51:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 10:51:50,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-28 10:51:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:50,788 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-28 10:51:50,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:51:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-28 10:51:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:51:50,789 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:50,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:51:50,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-28 10:51:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:50,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:50,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:50,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:50,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:50,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:50,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:50,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:51:50,882 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-28 10:51:50,944 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:50,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:51:51,919 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:51:51,922 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:51:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:51,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:51:51,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:51,934 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-02-28 10:51:51,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:51,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:51,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:51:51,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:52,068 INFO L442 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 9 treesize of output 12 [2019-02-28 10:51:52,133 INFO L442 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 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 10:51:52,135 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:52,195 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:52,205 INFO L315 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-02-28 10:51:52,205 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-28 10:51:52,217 INFO L442 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 16 treesize of output 11 [2019-02-28 10:51:52,218 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:52,222 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:52,223 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-28 10:51:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:52,247 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:52,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:51:52,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-28 10:51:52,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:51:52,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:51:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:51:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:51:52,284 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-28 10:51:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:52,363 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-02-28 10:51:52,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:51:52,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:51:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:52,364 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:51:52,365 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:51:52,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:51:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:51:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-02-28 10:51:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:51:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-02-28 10:51:52,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-02-28 10:51:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:52,370 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-02-28 10:51:52,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:51:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-02-28 10:51:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:51:52,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:52,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:51:52,371 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-28 10:51:52,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:52,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:52,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:52,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:52,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:52,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:52,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:52,441 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:51:52,441 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-28 10:51:52,444 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:52,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:51:55,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:51:55,214 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:51:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:55,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:51:55,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:55,216 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-02-28 10:51:55,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:55,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:55,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:51:55,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:55,274 INFO L442 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 9 treesize of output 12 [2019-02-28 10:51:55,317 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:51:55,318 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-28 10:51:55,320 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:55,384 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:55,541 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:51:55,542 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:55,566 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:55,618 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:55,619 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 10:51:55,651 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:51:55,651 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:55,666 INFO L315 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-02-28 10:51:55,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-02-28 10:51:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:55,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:55,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:55,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:51:55,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:55,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:51:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:51:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:51:55,918 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-02-28 10:51:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:56,151 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-28 10:51:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:51:56,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:51:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:56,153 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:51:56,153 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:51:56,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:51:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:51:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-02-28 10:51:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:51:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-02-28 10:51:56,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-02-28 10:51:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:56,158 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-02-28 10:51:56,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:51:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-02-28 10:51:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:51:56,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:56,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:51:56,159 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-28 10:51:56,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:56,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:56,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:56,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:56,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:56,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:51:56,263 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-28 10:51:56,265 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:56,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:51:56,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:51:56,616 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:51:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:56,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:51:56,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:56,616 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-02-28 10:51:56,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:56,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:56,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:51:56,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:56,710 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:51:56,711 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,736 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,745 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-28 10:51:56,748 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-28 10:51:56,749 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,757 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,766 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,766 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 10:51:56,788 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:51:56,789 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,794 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,795 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-28 10:51:56,842 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:51:56,844 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:56,854 INFO L315 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-02-28 10:51:56,854 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-02-28 10:51:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:56,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:57,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:57,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:51:57,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:57,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:51:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:51:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:51:57,201 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-02-28 10:51:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:57,449 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-02-28 10:51:57,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:51:57,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:51:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:57,451 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:51:57,451 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:51:57,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:51:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:51:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-02-28 10:51:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:51:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 10:51:57,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-02-28 10:51:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:57,456 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-28 10:51:57,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:51:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-28 10:51:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:51:57,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:57,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:51:57,457 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-02-28 10:51:57,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:57,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:57,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:57,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:57,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:57,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:51:57,497 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-02-28 10:51:57,498 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:57,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:51:59,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:51:59,398 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:51:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:59,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:51:59,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:59,399 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-02-28 10:51:59,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:59,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:59,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:51:59,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:59,447 INFO L442 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 9 treesize of output 12 [2019-02-28 10:51:59,555 INFO L442 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 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 10:51:59,555 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:59,564 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:59,570 INFO L315 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-02-28 10:51:59,570 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-28 10:51:59,597 INFO L442 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 16 treesize of output 11 [2019-02-28 10:51:59,597 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:59,621 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:59,622 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-02-28 10:51:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:59,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:51:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:51:59,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:51:59,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:51:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:51:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:51:59,737 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-28 10:51:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:59,785 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-02-28 10:51:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:51:59,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:51:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:59,787 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:51:59,787 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:51:59,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:51:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:51:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-02-28 10:51:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:51:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-02-28 10:51:59,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-02-28 10:51:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:59,792 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-02-28 10:51:59,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:51:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-02-28 10:51:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:51:59,792 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:59,792 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:51:59,793 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-02-28 10:51:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:59,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:51:59,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:51:59,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:51:59,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:51:59,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:51:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:51:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:51:59,846 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-02-28 10:51:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:59,868 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-02-28 10:51:59,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:51:59,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:51:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:59,869 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:51:59,869 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:51:59,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:51:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:51:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:51:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:51:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-28 10:51:59,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-02-28 10:51:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:59,874 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-02-28 10:51:59,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:51:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-28 10:51:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:51:59,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:59,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:51:59,875 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-02-28 10:51:59,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:59,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:59,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:59,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:59,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:59,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:59,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:51:59,955 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-02-28 10:51:59,957 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:59,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:00,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:00,318 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:52:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:00,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:00,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:00,318 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-02-28 10:52:00,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:00,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:00,371 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:52:00,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:00,434 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:52:00,434 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,459 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,522 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-28 10:52:00,526 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-28 10:52:00,527 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,535 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,546 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,547 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 10:52:00,566 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:52:00,567 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,574 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,574 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-02-28 10:52:00,658 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:52:00,659 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,664 INFO L315 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-02-28 10:52:00,665 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-28 10:52:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:00,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:00,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:00,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:52:00,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:00,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:52:00,731 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2019-02-28 10:52:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:00,815 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-02-28 10:52:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:52:00,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:52:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:00,816 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:52:00,817 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:52:00,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:52:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:52:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:52:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:52:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:52:00,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-28 10:52:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:00,818 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:52:00,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:52:00,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:52:00,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:52:01,124 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-02-28 10:52:01,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:52:01,127 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-02-28 10:52:01,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:52:01,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-02-28 10:52:01,127 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse3 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 .cse3)) (and (= .cse2 0) (= 0 .cse3))))) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p2))) (or (and .cse0 (= 0 .cse1)) (and .cse0 (<= (+ .cse1 1) 0))))) [2019-02-28 10:52:01,127 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-02-28 10:52:01,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-02-28 10:52:01,137 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:52:01 BoogieIcfgContainer [2019-02-28 10:52:01,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:52:01,137 INFO L168 Benchmark]: Toolchain (without parser) took 11261.11 ms. Allocated memory was 132.6 MB in the beginning and 577.2 MB in the end (delta: 444.6 MB). Free memory was 106.7 MB in the beginning and 435.4 MB in the end (delta: -328.7 MB). Peak memory consumption was 115.9 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,138 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:52:01,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.18 ms. Allocated memory is still 132.6 MB. Free memory was 106.5 MB in the beginning and 104.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,140 INFO L168 Benchmark]: Boogie Preprocessor took 24.40 ms. Allocated memory is still 132.6 MB. Free memory was 104.4 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,140 INFO L168 Benchmark]: RCFGBuilder took 323.29 ms. Allocated memory is still 132.6 MB. Free memory was 103.3 MB in the beginning and 94.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,141 INFO L168 Benchmark]: TraceAbstraction took 10856.18 ms. Allocated memory was 132.6 MB in the beginning and 577.2 MB in the end (delta: 444.6 MB). Free memory was 94.1 MB in the beginning and 435.4 MB in the end (delta: -341.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,145 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.18 ms. Allocated memory is still 132.6 MB. Free memory was 106.5 MB in the beginning and 104.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.40 ms. Allocated memory is still 132.6 MB. Free memory was 104.4 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 323.29 ms. Allocated memory is still 132.6 MB. Free memory was 103.3 MB in the beginning and 94.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10856.18 ms. Allocated memory was 132.6 MB in the beginning and 577.2 MB in the end (delta: 444.6 MB). Free memory was 94.1 MB in the beginning and 435.4 MB in the end (delta: -341.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 10.7s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 31 SDslu, 1 SDs, 0 SdLazy, 175 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.4s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 4 QuantifiedInterpolants, 1521 SizeOfPredicates, 11 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...