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-fa1c628-m [2019-01-31 17:05:56,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:05:56,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:05:56,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:05:56,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:05:56,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:05:56,919 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:05:56,921 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:05:56,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:05:56,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:05:56,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:05:56,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:05:56,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:05:56,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:05:56,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:05:56,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:05:56,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:05:56,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:05:56,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:05:56,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:05:56,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:05:56,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:05:56,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:05:56,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:05:56,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:05:56,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:05:56,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:05:56,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:05:56,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:05:56,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:05:56,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:05:56,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:05:56,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:05:56,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:05:56,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:05:56,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:05:56,961 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-31 17:05:56,974 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:05:56,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:05:56,975 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:05:56,975 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:05:56,975 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:05:56,976 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:05:56,976 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:05:56,976 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:05:56,976 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:05:56,977 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:05:56,977 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:05:56,977 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:05:56,977 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:05:56,977 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:05:56,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:05:56,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:05:56,978 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:05:56,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:05:56,979 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:05:56,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:05:56,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:05:56,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:05:56,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:05:56,980 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:05:56,980 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:05:56,980 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:05:56,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:05:56,980 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:05:56,981 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:05:56,981 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:05:56,981 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:05:56,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:05:56,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:05:56,982 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:05:56,982 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:05:56,982 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:05:56,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:05:56,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:05:56,983 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:05:56,983 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:05:57,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:05:57,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:05:57,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:05:57,060 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:05:57,060 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:05:57,061 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-31 17:05:57,061 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-31 17:05:57,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:05:57,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:05:57,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:05:57,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:05:57,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:05:57,124 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,136 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:05:57,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:05:57,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:05:57,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:05:57,179 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,179 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,181 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,181 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,185 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,189 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,192 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 31.01 05:05:57" (1/1) ... [2019-01-31 17:05:57,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:05:57,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:05:57,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:05:57,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:05:57,201 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 31.01 05:05:57" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:05:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:05:57,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:05:57,543 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:05:57,543 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-31 17:05:57,545 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:05:57 BoogieIcfgContainer [2019-01-31 17:05:57,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:05:57,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:05:57,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:05:57,549 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:05:57,550 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 31.01 05:05:57" (1/2) ... [2019-01-31 17:05:57,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399736de and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:05:57, skipping insertion in model container [2019-01-31 17:05:57,551 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 31.01 05:05:57" (2/2) ... [2019-01-31 17:05:57,553 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-31 17:05:57,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:05:57,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-31 17:05:57,587 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-31 17:05:57,618 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:05:57,618 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:05:57,618 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:05:57,618 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:05:57,618 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:05:57,618 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:05:57,619 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:05:57,619 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:05:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-31 17:05:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:05:57,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:57,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:05:57,643 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-31 17:05:57,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:57,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:57,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:57,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:57,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:57,838 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-31 17:05:57,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:05:57,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:05:57,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:05:57,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:05:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:05:57,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:05:57,865 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-31 17:05:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:58,064 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-31 17:05:58,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:05:58,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:05:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:58,080 INFO L225 Difference]: With dead ends: 17 [2019-01-31 17:05:58,080 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:05:58,083 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-31 17:05:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:05:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-31 17:05:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:05:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-31 17:05:58,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-31 17:05:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:58,122 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-31 17:05:58,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:05:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-31 17:05:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:05:58,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:58,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:05:58,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:58,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-31 17:05:58,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:58,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:58,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:58,168 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-31 17:05:58,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:05:58,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:05:58,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:05:58,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:05:58,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:05:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:05:58,172 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-31 17:05:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:58,284 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 17:05:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:05:58,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:05:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:58,286 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:05:58,286 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:05:58,287 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-31 17:05:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:05:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-31 17:05:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 17:05:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-31 17:05:58,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-31 17:05:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:58,292 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-31 17:05:58,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:05:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-31 17:05:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:05:58,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:58,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:05:58,293 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-31 17:05:58,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:58,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:58,359 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-31 17:05:58,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:58,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:58,360 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:05:58,362 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-31 17:05:58,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:05:58,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:05:58,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:05:58,481 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-31 17:05:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:58,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:05:58,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:58,487 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-31 17:05:58,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:58,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:05:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:58,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:58,571 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-31 17:05:58,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:58,586 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-31 17:05:58,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:58,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:58,600 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-31 17:05:58,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:58,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:58,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:58,750 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-31 17:05:58,751 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2019-01-31 17:05:58,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:58,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:58,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:58,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:58,900 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-31 17:05:58,902 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-31 17:05:58,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:59,017 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-31 17:05:59,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:05:59,112 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-31 17:05:59,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:59,138 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-31 17:05:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:05:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:05:59,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:05:59,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:05:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:05:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:05:59,159 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-31 17:05:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:59,239 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-31 17:05:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:05:59,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:05:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:59,241 INFO L225 Difference]: With dead ends: 13 [2019-01-31 17:05:59,241 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:05:59,244 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-31 17:05:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:05:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-31 17:05:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:05:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-31 17:05:59,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-31 17:05:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:59,252 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-31 17:05:59,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:05:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-31 17:05:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:05:59,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:59,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:05:59,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-31 17:05:59,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:59,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:59,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:59,432 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-31 17:05:59,438 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-31 17:05:59,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:59,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:59,439 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:05:59,439 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-31 17:05:59,442 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:05:59,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:05:59,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:05:59,448 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-31 17:05:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:59,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:05:59,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:59,449 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-31 17:05:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:59,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:05:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:59,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:59,472 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-31 17:05:59,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:59,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:05:59,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:59,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:59,498 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-31 17:05:59,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:59,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:59,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:59,574 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-31 17:05:59,575 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-31 17:05:59,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:59,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:59,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:59,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:05:59,672 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-31 17:05:59,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:59,697 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-31 17:05:59,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:05:59,716 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-31 17:05:59,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:59,733 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-31 17:05:59,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:59,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:05:59,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:59,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:05:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:05:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:05:59,754 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-31 17:06:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:00,304 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-31 17:06:00,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:00,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:00,306 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:06:00,306 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:06:00,306 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-31 17:06:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:06:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-31 17:06:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:06:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-31 17:06:00,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-31 17:06:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:00,312 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-31 17:06:00,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-31 17:06:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:00,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:00,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:00,313 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-31 17:06:00,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:00,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:00,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:00,346 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-31 17:06:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:00,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:00,348 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-31 17:06:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:00,383 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-31 17:06:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:00,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:06:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:00,384 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:06:00,384 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:06:00,385 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-31 17:06:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:06:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 17:06:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:06:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-31 17:06:00,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-31 17:06:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:00,390 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-31 17:06:00,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-31 17:06:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:00,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:00,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:00,391 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-31 17:06:00,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:00,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:00,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:00,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:00,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:00,501 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-31 17:06:00,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:00,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:00,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:00,502 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-31 17:06:00,506 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:00,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:00,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:00,569 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-31 17:06:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:00,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:00,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:00,570 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-31 17:06:00,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:00,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:00,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:00,592 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-31 17:06:00,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:00,600 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-31 17:06:00,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:00,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:00,621 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-31 17:06:00,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:00,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:00,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:00,692 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-31 17:06:00,692 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:00,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:00,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:00,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:00,743 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-31 17:06:00,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:00,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:00,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:00,807 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-31 17:06:00,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:00,827 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-31 17:06:00,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:00,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:00,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:00,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:00,847 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-31 17:06:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:01,000 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-31 17:06:01,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:01,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:01,001 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:06:01,002 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:06:01,002 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-31 17:06:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:06:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-31 17:06:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:06:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-31 17:06:01,008 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-31 17:06:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:01,008 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-31 17:06:01,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-31 17:06:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:01,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:01,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:01,010 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-31 17:06:01,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:01,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:01,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:01,123 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-31 17:06:01,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:01,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:01,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:01,124 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-31 17:06:01,127 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:01,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:01,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:01,132 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-31 17:06:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:01,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:01,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:01,133 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-31 17:06:01,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:01,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:01,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:01,156 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-31 17:06:01,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,163 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-31 17:06:01,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:06:01,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,240 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-31 17:06:01,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:01,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,278 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-31 17:06:01,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,295 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-31 17:06:01,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:01,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:06:01,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,392 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-31 17:06:01,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:01,409 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-31 17:06:01,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:01,434 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-31 17:06:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:01,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:01,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:01,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:01,455 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-31 17:06:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:01,717 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-31 17:06:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:01,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:01,719 INFO L225 Difference]: With dead ends: 35 [2019-01-31 17:06:01,719 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 17:06:01,719 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-31 17:06:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 17:06:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-31 17:06:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 17:06:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-31 17:06:01,725 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-31 17:06:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:01,726 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-31 17:06:01,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-31 17:06:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:01,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:01,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:01,727 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-31 17:06:01,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:01,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:01,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:01,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:01,761 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-31 17:06:01,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:01,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:01,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:01,762 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-31 17:06:01,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:01,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:01,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:01,774 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-31 17:06:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:01,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:01,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:01,776 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-31 17:06:01,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:01,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:01,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:01,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:06:01,821 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-31 17:06:01,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,834 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-31 17:06:01,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,909 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-31 17:06:01,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2019-01-31 17:06:01,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:01,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:06:01,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:01,955 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-31 17:06:01,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-31 17:06:01,971 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-31 17:06:01,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:01,980 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-31 17:06:01,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:02,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:06:02,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:02,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:02,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:02,001 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-31 17:06:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:02,047 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-31 17:06:02,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:06:02,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:06:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:02,049 INFO L225 Difference]: With dead ends: 30 [2019-01-31 17:06:02,049 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 17:06:02,050 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-31 17:06:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 17:06:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-31 17:06:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:06:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-31 17:06:02,058 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-31 17:06:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:02,058 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-31 17:06:02,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-31 17:06:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:02,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:02,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:02,060 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-31 17:06:02,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:02,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:02,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:02,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:02,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:02,174 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-31 17:06:02,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:02,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:02,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:02,175 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-31 17:06:02,177 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:02,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:02,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:02,182 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-31 17:06:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:02,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:02,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:02,183 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-31 17:06:02,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:02,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:02,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:02,207 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-31 17:06:02,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,217 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-31 17:06:02,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,229 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-31 17:06:02,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,273 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:02,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:06:02,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,333 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-31 17:06:02,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:02,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,367 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-31 17:06:02,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,414 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-31 17:06:02,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:06:02,431 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-31 17:06:02,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:02,454 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-31 17:06:02,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:02,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:02,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:02,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:02,475 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-31 17:06:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:02,770 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2019-01-31 17:06:02,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:02,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:02,772 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:06:02,772 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 17:06:02,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 17:06:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-01-31 17:06:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:06:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-31 17:06:02,782 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-31 17:06:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:02,783 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-31 17:06:02,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-31 17:06:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:02,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:02,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:02,784 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-31 17:06:02,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:02,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:02,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:02,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:02,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:02,856 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-31 17:06:02,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:02,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:02,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:02,857 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-31 17:06:02,859 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:02,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:02,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:02,863 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-31 17:06:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:02,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:02,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:02,864 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-31 17:06:02,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:02,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:02,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:02,899 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-31 17:06:02,913 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-31 17:06:02,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,923 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-31 17:06:02,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,950 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-31 17:06:02,951 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-31 17:06:02,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:02,986 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-31 17:06:02,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:03,001 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-31 17:06:03,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-31 17:06:03,012 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-31 17:06:03,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:03,023 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-31 17:06:03,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:03,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:03,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:03,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:03,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:03,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:03,043 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-31 17:06:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:03,158 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2019-01-31 17:06:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:03,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:03,163 INFO L225 Difference]: With dead ends: 38 [2019-01-31 17:06:03,164 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:06:03,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:06:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-01-31 17:06:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:06:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-31 17:06:03,173 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-31 17:06:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:03,173 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-31 17:06:03,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-31 17:06:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:03,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:03,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:03,174 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:03,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:03,175 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-31 17:06:03,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:03,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:03,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,235 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-31 17:06:03,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:03,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:03,236 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-31 17:06:03,237 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:03,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:03,243 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:03,243 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-31 17:06:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:03,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:03,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:03,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:03,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:03,266 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-31 17:06:03,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,310 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-31 17:06:03,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,374 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-31 17:06:03,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:03,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:03,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:03,495 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-31 17:06:03,496 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:03,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,514 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-31 17:06:03,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:03,531 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-31 17:06:03,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:03,633 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-31 17:06:03,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:03,645 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-31 17:06:03,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:03,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:06:03,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:03,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:03,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:03,667 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2019-01-31 17:06:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:03,767 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2019-01-31 17:06:03,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:03,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:06:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:03,773 INFO L225 Difference]: With dead ends: 38 [2019-01-31 17:06:03,773 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:06:03,773 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-31 17:06:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:06:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-31 17:06:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 17:06:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2019-01-31 17:06:03,782 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2019-01-31 17:06:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:03,783 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2019-01-31 17:06:03,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2019-01-31 17:06:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:03,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:03,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:03,784 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:03,784 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-31 17:06:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:03,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,923 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-31 17:06:03,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:03,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:03,924 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-31 17:06:03,926 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:03,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:03,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:03,930 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-31 17:06:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:03,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:03,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,931 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-31 17:06:03,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:03,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:03,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:06:03,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,959 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-31 17:06:03,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:03,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:06:03,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:03,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:03,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,012 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:04,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,056 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-31 17:06:04,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,082 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-31 17:06:04,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:04,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,133 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:04,134 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-31 17:06:04,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,159 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-31 17:06:04,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:04,190 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-31 17:06:04,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:04,356 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-31 17:06:04,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:04,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:04,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:04,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:04,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:04,379 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2019-01-31 17:06:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:04,551 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2019-01-31 17:06:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:04,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:04,552 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:06:04,553 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 17:06:04,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 17:06:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-01-31 17:06:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:06:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2019-01-31 17:06:04,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2019-01-31 17:06:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:04,562 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2019-01-31 17:06:04,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2019-01-31 17:06:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:04,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:04,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:04,564 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:04,564 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-31 17:06:04,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:04,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:04,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:04,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:04,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:04,638 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-31 17:06:04,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:04,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:04,638 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:04,638 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-31 17:06:04,640 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:04,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:04,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:04,645 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-31 17:06:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:04,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:04,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:04,645 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-31 17:06:04,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:04,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:04,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:04,672 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-31 17:06:04,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,678 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-31 17:06:04,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,691 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-31 17:06:04,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,718 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-31 17:06:04,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:04,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,744 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-31 17:06:04,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,778 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-31 17:06:04,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:04,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:04,806 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-31 17:06:04,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:04,825 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-31 17:06:04,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:06:04,839 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-31 17:06:04,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:04,858 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-31 17:06:04,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:04,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:04,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:04,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:04,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:04,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:04,879 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2019-01-31 17:06:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:05,289 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-01-31 17:06:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:05,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:05,290 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:06:05,290 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:06:05,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:06:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-31 17:06:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:06:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-01-31 17:06:05,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-01-31 17:06:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:05,302 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-01-31 17:06:05,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-01-31 17:06:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:05,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:05,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:05,303 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-31 17:06:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:05,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:05,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:05,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:05,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:05,388 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-31 17:06:05,390 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:05,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:05,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:05,396 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-31 17:06:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:05,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:05,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:05,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:05,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:05,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:05,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:05,418 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-31 17:06:05,422 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-31 17:06:05,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:05,434 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-31 17:06:05,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:05,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:05,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:05,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:05,492 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-31 17:06:05,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:05,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:05,514 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-31 17:06:05,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:05,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:05,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-31 17:06:05,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:05,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:05,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:05,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:05,539 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-31 17:06:05,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:05,551 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-31 17:06:05,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-31 17:06:05,563 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-31 17:06:05,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:05,584 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-31 17:06:05,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:05,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:05,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:05,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:05,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:05,606 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2019-01-31 17:06:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:05,882 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-01-31 17:06:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:05,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:05,883 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:06:05,883 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:06:05,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:06:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-31 17:06:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:06:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-01-31 17:06:05,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-01-31 17:06:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:05,893 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-01-31 17:06:05,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-01-31 17:06:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:05,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:05,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:05,894 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-31 17:06:05,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:05,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:05,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:05,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:06,049 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-31 17:06:06,114 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-31 17:06:06,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:06,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:06,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:06,114 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-31 17:06:06,116 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:06,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:06,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:06,120 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-31 17:06:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:06,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:06,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:06,121 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-31 17:06:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:06,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:06,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:06,138 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-31 17:06:06,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,147 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-31 17:06:06,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,168 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-31 17:06:06,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:06,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:06,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:06,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:06,197 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:06,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:06:06,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:06,248 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-31 17:06:06,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:06,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,286 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:06,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:06:06,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:06,302 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-31 17:06:06,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:06,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:06,336 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-31 17:06:06,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:06,353 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-31 17:06:06,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:06,365 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-31 17:06:06,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:06,409 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-31 17:06:06,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:06,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:06,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:06,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:06,429 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2019-01-31 17:06:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:06,861 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2019-01-31 17:06:06,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:06,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:06,862 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:06:06,863 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:06:06,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:06:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2019-01-31 17:06:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:06:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-31 17:06:06,872 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-31 17:06:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:06,872 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-31 17:06:06,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-31 17:06:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:06,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:06,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:06,873 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-31 17:06:06,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:06,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:06,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:06,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:06,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:07,021 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-31 17:06:07,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:07,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:07,021 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:07,021 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-31 17:06:07,023 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:07,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:07,028 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:07,028 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-31 17:06:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:07,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:07,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:07,029 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-31 17:06:07,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:07,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:07,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:07,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:06:07,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,100 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-31 17:06:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,129 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-31 17:06:07,129 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:07,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,182 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-31 17:06:07,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,195 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-31 17:06:07,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:07,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,220 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-31 17:06:07,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,237 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-31 17:06:07,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:07,253 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-31 17:06:07,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:07,284 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-31 17:06:07,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:07,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:07,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:07,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:07,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:07,307 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2019-01-31 17:06:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:07,471 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2019-01-31 17:06:07,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:07,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:06:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:07,472 INFO L225 Difference]: With dead ends: 29 [2019-01-31 17:06:07,473 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:06:07,474 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-31 17:06:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:06:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-31 17:06:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 17:06:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2019-01-31 17:06:07,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2019-01-31 17:06:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:07,484 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2019-01-31 17:06:07,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-01-31 17:06:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:07,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:07,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:07,485 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-31 17:06:07,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:07,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:07,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:07,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:07,634 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-31 17:06:07,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:07,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:07,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:07,636 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-31 17:06:07,637 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:07,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:07,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:07,641 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-31 17:06:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:07,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:07,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:07,642 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-31 17:06:07,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:07,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:07,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:07,664 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-31 17:06:07,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,674 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-31 17:06:07,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,685 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-31 17:06:07,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-31 17:06:07,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:06:07,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,776 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-31 17:06:07,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:07,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,806 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-31 17:06:07,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,926 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-31 17:06:07,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:07,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,952 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:07,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:07,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:06:07,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:07,973 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-31 17:06:07,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:06:07,992 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-31 17:06:07,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:08,021 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-31 17:06:08,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:08,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:06:08,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:08,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:08,042 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2019-01-31 17:06:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:08,262 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2019-01-31 17:06:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:08,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:08,263 INFO L225 Difference]: With dead ends: 27 [2019-01-31 17:06:08,264 INFO L226 Difference]: Without dead ends: 26 [2019-01-31 17:06:08,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-31 17:06:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2019-01-31 17:06:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:06:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-31 17:06:08,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2019-01-31 17:06:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:08,271 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2019-01-31 17:06:08,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2019-01-31 17:06:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:08,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:08,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:08,272 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2019-01-31 17:06:08,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:08,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:08,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:08,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:08,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:08,386 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:08,386 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2019-01-31 17:06:08,386 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:08,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:08,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:08,391 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-31 17:06:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:08,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:08,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:08,391 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-31 17:06:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:08,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:08,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:08,408 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-31 17:06:08,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:06:08,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:08,422 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-31 17:06:08,422 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:08,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:08,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:08,442 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-31 17:06:08,443 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-31 17:06:08,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:08,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:08,460 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-31 17:06:08,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:08,468 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-31 17:06:08,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-31 17:06:08,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:08,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:08,511 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-31 17:06:08,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:08,525 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-31 17:06:08,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-31 17:06:08,587 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-31 17:06:08,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:08,603 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-31 17:06:08,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:08,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:08,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:08,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:08,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:08,623 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2019-01-31 17:06:09,102 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-31 17:06:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:09,383 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2019-01-31 17:06:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:09,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:06:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:09,384 INFO L225 Difference]: With dead ends: 14 [2019-01-31 17:06:09,384 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:06:09,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:06:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:06:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:06:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:06:09,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-31 17:06:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:09,386 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:06:09,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:06:09,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:06:09,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:06:09,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:06:09,561 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2019-01-31 17:06:10,439 WARN L181 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2019-01-31 17:06:10,443 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:06:10,443 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-31 17:06:10,443 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-31 17:06:10,443 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:06:10,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-31 17:06:10,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-01-31 17:06:10,444 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-01-31 17:06:10,444 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-31 17:06:10,444 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-31 17:06:10,455 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:06:10 BoogieIcfgContainer [2019-01-31 17:06:10,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:06:10,456 INFO L168 Benchmark]: Toolchain (without parser) took 13352.88 ms. Allocated memory was 133.7 MB in the beginning and 321.9 MB in the end (delta: 188.2 MB). Free memory was 108.9 MB in the beginning and 100.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 197.0 MB. Max. memory is 7.1 GB. [2019-01-31 17:06:10,457 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:06:10,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.93 ms. Allocated memory is still 133.7 MB. Free memory was 108.5 MB in the beginning and 106.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:06:10,458 INFO L168 Benchmark]: Boogie Preprocessor took 28.33 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 105.6 MB in the end (delta: 875.6 kB). Peak memory consumption was 875.6 kB. Max. memory is 7.1 GB. [2019-01-31 17:06:10,458 INFO L168 Benchmark]: RCFGBuilder took 350.83 ms. Allocated memory is still 133.7 MB. Free memory was 105.1 MB in the beginning and 95.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-01-31 17:06:10,458 INFO L168 Benchmark]: TraceAbstraction took 12909.53 ms. Allocated memory was 133.7 MB in the beginning and 321.9 MB in the end (delta: 188.2 MB). Free memory was 95.2 MB in the beginning and 100.2 MB in the end (delta: -5.0 MB). Peak memory consumption was 183.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:06:10,461 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.17 ms. Allocated memory is still 133.7 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.93 ms. Allocated memory is still 133.7 MB. Free memory was 108.5 MB in the beginning and 106.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.33 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 105.6 MB in the end (delta: 875.6 kB). Peak memory consumption was 875.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 350.83 ms. Allocated memory is still 133.7 MB. Free memory was 105.1 MB in the beginning and 95.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12909.53 ms. Allocated memory was 133.7 MB in the beginning and 321.9 MB in the end (delta: 188.2 MB). Free memory was 95.2 MB in the beginning and 100.2 MB in the end (delta: -5.0 MB). Peak memory consumption was 183.3 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, 12.8s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 127 SDslu, 1 SDs, 0 SdLazy, 1173 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.5s 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.2s 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, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.8s 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...