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-a9d37a5-m [2019-02-28 10:22:07,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:22:07,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:22:07,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:22:07,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:22:07,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:22:07,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:22:07,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:22:07,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:22:07,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:22:07,290 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:22:07,290 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:22:07,291 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:22:07,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:22:07,293 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:22:07,294 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:22:07,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:22:07,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:22:07,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:22:07,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:22:07,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:22:07,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:22:07,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:22:07,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:22:07,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:22:07,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:22:07,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:22:07,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:22:07,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:22:07,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:22:07,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:22:07,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:22:07,321 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:22:07,322 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:22:07,323 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:22:07,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:22:07,324 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-02-28 10:22:07,346 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:22:07,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:22:07,347 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:22:07,347 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:22:07,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:22:07,348 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:22:07,348 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:22:07,348 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:22:07,348 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:22:07,349 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:22:07,349 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:22:07,350 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:22:07,350 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:22:07,350 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:22:07,351 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:22:07,351 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:22:07,351 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:22:07,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:22:07,352 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:22:07,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:22:07,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:22:07,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:22:07,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:22:07,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:22:07,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:22:07,354 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:22:07,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:22:07,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:22:07,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:22:07,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:22:07,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:22:07,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:22:07,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:22:07,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:22:07,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:22:07,357 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:22:07,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:22:07,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:22:07,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:22:07,358 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:22:07,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:22:07,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:22:07,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:22:07,438 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:22:07,439 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:22:07,440 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-02-28 10:22:07,440 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-02-28 10:22:07,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:22:07,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:22:07,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:07,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:22:07,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:22:07,499 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,513 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:07,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:22:07,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:22:07,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:22:07,549 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,549 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,550 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,551 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,553 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,557 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,558 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 28.02 10:22:07" (1/1) ... [2019-02-28 10:22:07,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:22:07,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:22:07,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:22:07,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:22:07,562 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 28.02 10:22:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:22:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:22:07,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:22:07,982 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:22:07,982 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-28 10:22:07,984 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:22:07 BoogieIcfgContainer [2019-02-28 10:22:07,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:22:07,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:22:07,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:22:07,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:22:07,991 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 28.02 10:22:07" (1/2) ... [2019-02-28 10:22:07,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61118273 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:22:07, skipping insertion in model container [2019-02-28 10:22:07,992 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 28.02 10:22:07" (2/2) ... [2019-02-28 10:22:07,995 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-02-28 10:22:08,005 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:22:08,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-28 10:22:08,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-28 10:22:08,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:22:08,061 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:22:08,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:22:08,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:22:08,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:22:08,062 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:22:08,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:22:08,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:22:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-28 10:22:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:22:08,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:08,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:22:08,087 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-28 10:22:08,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:08,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:08,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:08,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:08,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:08,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:08,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:08,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:08,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:08,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:08,298 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-28 10:22:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:08,498 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-28 10:22:08,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:08,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:22:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:08,515 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:22:08,515 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:22:08,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:22:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-28 10:22:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:22:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-28 10:22:08,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-28 10:22:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:08,558 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-28 10:22:08,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-28 10:22:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:08,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:08,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:08,560 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:08,560 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-28 10:22:08,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:08,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:08,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:08,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:08,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:08,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:08,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:08,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:08,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:08,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:08,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:08,636 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-28 10:22:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:08,725 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-28 10:22:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:08,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:22:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:08,727 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:22:08,727 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:22:08,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:22:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-28 10:22:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:22:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-28 10:22:08,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-28 10:22:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:08,734 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-28 10:22:08,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-28 10:22:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:08,735 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:08,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:08,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-28 10:22:08,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:08,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:08,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:08,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:08,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:08,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:08,817 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-28 10:22:08,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:08,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:08,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:08,930 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-02-28 10:22:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:08,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:08,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:08,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:08,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:08,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:08,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:08,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:09,068 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:09,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:09,120 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:09,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:09,183 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:09,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:09,209 INFO L442 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 16 [2019-02-28 10:22:09,214 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:09,258 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:09,292 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:09,361 INFO L315 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-02-28 10:22:09,362 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:09,443 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:09,452 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:09,478 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:09,481 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:09,482 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:09,521 INFO L315 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-02-28 10:22:09,521 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:09,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:09,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:22:09,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:09,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:22:09,633 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-02-28 10:22:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:09,808 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-02-28 10:22:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:22:09,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:22:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:09,810 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:22:09,810 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:22:09,811 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-02-28 10:22:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:22:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-02-28 10:22:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:22:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-02-28 10:22:09,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-02-28 10:22:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:09,818 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-02-28 10:22:09,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-02-28 10:22:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:09,820 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:09,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:09,820 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-28 10:22:09,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:09,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:09,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:09,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:09,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:09,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:09,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:09,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:09,946 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-28 10:22:09,947 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:09,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:09,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:09,954 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-02-28 10:22:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:09,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:09,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:09,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:09,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:09,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:09,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:09,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:10,007 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:10,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:10,093 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:10,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:10,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:10,150 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:10,151 INFO L442 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 16 [2019-02-28 10:22:10,152 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:10,165 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:10,171 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:10,237 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:10,237 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:10,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:10,296 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:10,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:10,317 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:10,318 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:10,420 INFO L315 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-02-28 10:22:10,420 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:10,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:10,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:10,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:10,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:10,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:10,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:10,490 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-02-28 10:22:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:10,853 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-02-28 10:22:10,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:10,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:22:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:10,857 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:22:10,857 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:22:10,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:22:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-02-28 10:22:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:22:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-02-28 10:22:10,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-02-28 10:22:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:10,868 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-02-28 10:22:10,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-02-28 10:22:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:10,870 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:10,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:10,871 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-02-28 10:22:10,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:10,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:10,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:10,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:10,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:10,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:10,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:10,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:10,958 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-02-28 10:22:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:11,137 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-02-28 10:22:11,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:11,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:22:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:11,138 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:22:11,138 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:22:11,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:22:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:22:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:22:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-02-28 10:22:11,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-02-28 10:22:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:11,143 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-02-28 10:22:11,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-28 10:22:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:11,144 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:11,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:11,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-02-28 10:22:11,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:11,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:11,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:11,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:11,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:11,231 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-02-28 10:22:11,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:11,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:11,243 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:11,244 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-02-28 10:22:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:11,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:11,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:11,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:11,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:11,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:11,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:11,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:11,273 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:11,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,287 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:11,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,299 INFO L442 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 16 [2019-02-28 10:22:11,299 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:11,313 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:11,350 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:11,363 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:11,363 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:11,401 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,404 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,405 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,407 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:11,408 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:11,426 INFO L315 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-02-28 10:22:11,427 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:11,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:11,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:11,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:11,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:11,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:11,503 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-02-28 10:22:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:11,710 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-02-28 10:22:11,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:11,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:22:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:11,712 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:22:11,712 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:22:11,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-02-28 10:22:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:22:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-02-28 10:22:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:22:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-02-28 10:22:11,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-02-28 10:22:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:11,719 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-02-28 10:22:11,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-02-28 10:22:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:11,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:11,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:11,720 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-28 10:22:11,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:11,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:11,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:11,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:11,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:11,826 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:11,826 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-28 10:22:11,829 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:11,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:11,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:11,835 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-02-28 10:22:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:11,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:11,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:11,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:11,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:11,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:11,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:11,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:11,865 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:11,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,880 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:11,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,892 INFO L442 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 16 [2019-02-28 10:22:11,893 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:11,904 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:11,930 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:11,947 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:11,947 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:11,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:11,997 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:11,998 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:12,017 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:12,018 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:12,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:12,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:12,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:12,089 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:12,091 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:12,104 INFO L315 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-02-28 10:22:12,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:12,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:12,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:12,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:12,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:12,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:12,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:12,195 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-02-28 10:22:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:12,497 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-02-28 10:22:12,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:12,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:12,499 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:22:12,499 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:22:12,500 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-02-28 10:22:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:22:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-02-28 10:22:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:22:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-02-28 10:22:12,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-02-28 10:22:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-02-28 10:22:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-02-28 10:22:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:12,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:12,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:12,508 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-02-28 10:22:12,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:12,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:12,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:12,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:12,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:12,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:12,548 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-02-28 10:22:12,550 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:12,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:12,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:12,555 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-02-28 10:22:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:12,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:12,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:12,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:12,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:12,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:12,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:22:12,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:12,577 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:12,594 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-02-28 10:22:12,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:12,625 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-02-28 10:22:12,626 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:12,635 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:12,643 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:12,655 INFO L315 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-02-28 10:22:12,655 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2019-02-28 10:22:12,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:12,723 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:22:12,724 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:12,747 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:12,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-02-28 10:22:12,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-02-28 10:22:12,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:12,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:12,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:22:12,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:12,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:12,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:12,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:22:12,794 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-02-28 10:22:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:12,856 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-02-28 10:22:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:22:12,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:22:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:12,859 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:22:12,859 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:22:12,860 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-02-28 10:22:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:22:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-02-28 10:22:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:22:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-02-28 10:22:12,868 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-02-28 10:22:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:12,868 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-02-28 10:22:12,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-02-28 10:22:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:12,869 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:12,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:12,869 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-28 10:22:12,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:12,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:12,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:12,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:12,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:12,974 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:12,975 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-28 10:22:12,977 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:12,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:12,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:12,982 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-02-28 10:22:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:12,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:12,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:12,983 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-02-28 10:22:12,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:12,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:12,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:12,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:13,002 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:13,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,008 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:13,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,019 INFO L442 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 16 [2019-02-28 10:22:13,019 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,034 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,039 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,050 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,051 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:13,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,099 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:13,100 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,249 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:13,249 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:13,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,422 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:22:13,423 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,435 INFO L315 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-02-28 10:22:13,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:22:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:13,455 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:13,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:13,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:13,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:13,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:13,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:13,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:13,499 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-02-28 10:22:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:13,712 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2019-02-28 10:22:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:13,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:13,714 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:22:13,714 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:22:13,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:22:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-02-28 10:22:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:22:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-28 10:22:13,725 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-28 10:22:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:13,725 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-28 10:22:13,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-28 10:22:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:13,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:13,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:13,726 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-02-28 10:22:13,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:13,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:13,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:13,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:13,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:13,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:13,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:13,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:13,795 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-02-28 10:22:13,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:13,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:13,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:13,801 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-02-28 10:22:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:13,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:13,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:13,801 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-02-28 10:22:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:13,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:13,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:22:13,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:13,819 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:13,843 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-02-28 10:22:13,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,868 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-02-28 10:22:13,869 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,879 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,887 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,899 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:13,900 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-02-28 10:22:13,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:13,921 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:22:13,922 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,928 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:13,928 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-28 10:22:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:13,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:13,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:13,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:13,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:13,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:13,974 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-02-28 10:22:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:14,395 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2019-02-28 10:22:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:14,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:22:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:14,401 INFO L225 Difference]: With dead ends: 38 [2019-02-28 10:22:14,401 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:22:14,402 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-02-28 10:22:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:22:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-02-28 10:22:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:22:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-28 10:22:14,415 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-28 10:22:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:14,415 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-28 10:22:14,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-28 10:22:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:14,417 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:14,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:14,417 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-02-28 10:22:14,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:14,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:14,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:14,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:14,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:14,530 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:14,530 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-02-28 10:22:14,532 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:14,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:14,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:14,538 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-02-28 10:22:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:14,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:14,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:14,538 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-02-28 10:22:14,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:14,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:14,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:14,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:14,557 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:14,562 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:14,563 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:14,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:14,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:14,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:14,575 INFO L442 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 16 [2019-02-28 10:22:14,576 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:14,581 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:14,588 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:14,600 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:14,601 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:14,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:14,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:14,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:14,634 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:14,635 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:14,652 INFO L315 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-02-28 10:22:14,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:14,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:14,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:14,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:22:14,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:14,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:14,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:14,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:14,758 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2019-02-28 10:22:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:14,821 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2019-02-28 10:22:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:14,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:22:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:14,823 INFO L225 Difference]: With dead ends: 38 [2019-02-28 10:22:14,823 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:22:14,824 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-02-28 10:22:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:22:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-28 10:22:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:22:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2019-02-28 10:22:14,834 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2019-02-28 10:22:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:14,834 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2019-02-28 10:22:14,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2019-02-28 10:22:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:14,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:14,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:14,836 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-02-28 10:22:14,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:14,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:14,979 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-28 10:22:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:15,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:15,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:15,007 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:15,007 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-02-28 10:22:15,008 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:15,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:15,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:15,013 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-02-28 10:22:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:15,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:15,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:15,014 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-02-28 10:22:15,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:15,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:15,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:15,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:15,034 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:15,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,041 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:15,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,049 INFO L442 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 16 [2019-02-28 10:22:15,050 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,061 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,072 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,082 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,083 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:15,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,195 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:15,196 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,216 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:15,216 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:15,262 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,263 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,264 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,266 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:15,267 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,281 INFO L315 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-02-28 10:22:15,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:15,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:15,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:15,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:15,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:15,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:15,368 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2019-02-28 10:22:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:15,690 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2019-02-28 10:22:15,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:15,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:15,692 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:22:15,692 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:22:15,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:22:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-02-28 10:22:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:22:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2019-02-28 10:22:15,700 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2019-02-28 10:22:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:15,700 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2019-02-28 10:22:15,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2019-02-28 10:22:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:15,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:15,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:15,702 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-02-28 10:22:15,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:15,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:15,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:15,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:15,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:15,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:15,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:15,777 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:15,777 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-02-28 10:22:15,779 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:15,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:15,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:15,783 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-02-28 10:22:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:15,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:15,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:15,784 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-02-28 10:22:15,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:15,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:15,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:15,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:15,814 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:15,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,822 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:15,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,834 INFO L442 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 16 [2019-02-28 10:22:15,834 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,847 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,858 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,879 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:15,880 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:15,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,916 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:15,917 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,939 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:15,939 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:15,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:15,970 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:22:15,972 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:15,989 INFO L315 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-02-28 10:22:15,989 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:22:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:16,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:16,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:16,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:16,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:16,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:16,091 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2019-02-28 10:22:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:16,414 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-02-28 10:22:16,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:16,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:16,416 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:22:16,416 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:22:16,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:22:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-28 10:22:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:22:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-02-28 10:22:16,428 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-02-28 10:22:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:16,428 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-02-28 10:22:16,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-02-28 10:22:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:16,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:16,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:16,429 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-02-28 10:22:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:16,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:16,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:16,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:16,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:16,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:16,509 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-02-28 10:22:16,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:16,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:16,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:16,519 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-02-28 10:22:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:16,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:16,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:16,520 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-02-28 10:22:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:16,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:16,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:16,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:16,557 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:16,585 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-02-28 10:22:16,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:16,604 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-02-28 10:22:16,605 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:16,615 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:16,620 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:16,630 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:16,630 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-02-28 10:22:16,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:16,698 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:22:16,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:16,710 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:16,710 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-02-28 10:22:16,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:16,724 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-02-28 10:22:16,725 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:16,731 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:16,732 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-28 10:22:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:16,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:16,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:16,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:16,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:16,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:16,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:16,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:16,785 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2019-02-28 10:22:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:16,993 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-02-28 10:22:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:16,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:16,994 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:22:16,995 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:22:16,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:22:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-28 10:22:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:22:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-02-28 10:22:17,008 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-02-28 10:22:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:17,008 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-02-28 10:22:17,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-02-28 10:22:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:17,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:17,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:17,009 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-02-28 10:22:17,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:17,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:17,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:17,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:17,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:17,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:17,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:17,295 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-28 10:22:17,297 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:17,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:17,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:17,301 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-02-28 10:22:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:17,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:17,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:17,302 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-02-28 10:22:17,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:17,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:17,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:17,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:17,320 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:17,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,327 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:17,330 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,332 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,333 INFO L442 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 16 [2019-02-28 10:22:17,334 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:17,339 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:17,346 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:17,364 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:17,364 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:17,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,382 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,385 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:17,385 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:17,396 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:17,397 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:17,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,423 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:17,424 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:17,434 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:17,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:17,454 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,456 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:17,457 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:17,458 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:17,469 INFO L315 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-02-28 10:22:17,469 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:17,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:17,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:17,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:22:17,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:17,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:17,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:17,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:22:17,551 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2019-02-28 10:22:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:17,959 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2019-02-28 10:22:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:22:17,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:22:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:17,961 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:22:17,961 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:22:17,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:22:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2019-02-28 10:22:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:22:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-28 10:22:17,973 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-02-28 10:22:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:17,973 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-28 10:22:17,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-28 10:22:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:17,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:17,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:17,974 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-02-28 10:22:17,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:17,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:17,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:17,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:17,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:18,159 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-28 10:22:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:18,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:18,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:18,215 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:18,215 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-02-28 10:22:18,217 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:18,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:18,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:18,223 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-02-28 10:22:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:18,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:18,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:18,224 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-02-28 10:22:18,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:18,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:18,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:18,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:18,272 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:18,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,298 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:18,308 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,314 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,315 INFO L442 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 16 [2019-02-28 10:22:18,315 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,323 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,328 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,339 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,339 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:18,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,372 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:18,373 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,385 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:18,385 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:18,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,428 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:18,429 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,440 INFO L315 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-02-28 10:22:18,441 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:18,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:18,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:18,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:18,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:18,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:18,502 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2019-02-28 10:22:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:18,664 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2019-02-28 10:22:18,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:18,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:22:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:18,666 INFO L225 Difference]: With dead ends: 29 [2019-02-28 10:22:18,666 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:22:18,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:22:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-02-28 10:22:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:22:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2019-02-28 10:22:18,677 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2019-02-28 10:22:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:18,678 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2019-02-28 10:22:18,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-02-28 10:22:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:18,678 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:18,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:18,679 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:18,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:18,679 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-02-28 10:22:18,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:18,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:18,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:18,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:18,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:18,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:18,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:18,875 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:18,875 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-02-28 10:22:18,876 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:18,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:18,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:18,883 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-02-28 10:22:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:18,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:18,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:18,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:22:18,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:18,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:18,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:18,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:18,910 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:18,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,915 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-28 10:22:18,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,925 INFO L442 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 16 [2019-02-28 10:22:18,925 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,932 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,942 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,951 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:18,951 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-28 10:22:18,970 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:18,973 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:18,973 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,006 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:19,007 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:19,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,048 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:19,048 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,058 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:19,058 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:19,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,079 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:22:19,080 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,090 INFO L315 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-02-28 10:22:19,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:22:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:19,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:19,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:19,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:22:19,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:19,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:19,162 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2019-02-28 10:22:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:19,401 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2019-02-28 10:22:19,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:22:19,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:22:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:19,403 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:22:19,403 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 10:22:19,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 10:22:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2019-02-28 10:22:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:22:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-02-28 10:22:19,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2019-02-28 10:22:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:19,410 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2019-02-28 10:22:19,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2019-02-28 10:22:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:19,411 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:19,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:19,411 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2019-02-28 10:22:19,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:19,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:19,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:19,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:19,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:19,507 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2019-02-28 10:22:19,508 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:19,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:19,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:19,513 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-02-28 10:22:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:19,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:19,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:19,513 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-02-28 10:22:19,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:19,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:19,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:19,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:19,533 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-28 10:22:19,545 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-02-28 10:22:19,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,564 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-02-28 10:22:19,564 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,577 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,588 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,595 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:19,595 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-02-28 10:22:19,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,632 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:22:19,633 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,639 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:19,639 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-02-28 10:22:19,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:19,651 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-02-28 10:22:19,651 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:19,657 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:19,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-28 10:22:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:19,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:19,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:19,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:22:19,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:19,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:19,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:22:19,834 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2019-02-28 10:22:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:20,213 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2019-02-28 10:22:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:20,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:22:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:20,214 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:22:20,214 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:22:20,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:22:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:22:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:22:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:22:20,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-28 10:22:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:20,216 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:22:20,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:22:20,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:22:20,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:22:20,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:22:20,393 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2019-02-28 10:22:22,352 WARN L181 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2019-02-28 10:22:22,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:22:22,355 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-02-28 10:22:22,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:22:22,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-02-28 10:22:22,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-28 10:22:22,360 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-02-28 10:22:22,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-28 10:22:22,361 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-28 10:22:22,361 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-02-28 10:22:22,373 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:22:22 BoogieIcfgContainer [2019-02-28 10:22:22,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:22:22,375 INFO L168 Benchmark]: Toolchain (without parser) took 14894.78 ms. Allocated memory was 133.2 MB in the beginning and 341.3 MB in the end (delta: 208.1 MB). Free memory was 106.1 MB in the beginning and 321.9 MB in the end (delta: -215.8 MB). Peak memory consumption was 197.7 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:22,375 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:22:22,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.39 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 103.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:22,376 INFO L168 Benchmark]: Boogie Preprocessor took 22.34 ms. Allocated memory is still 133.2 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:22,376 INFO L168 Benchmark]: RCFGBuilder took 423.90 ms. Allocated memory is still 133.2 MB. Free memory was 102.6 MB in the beginning and 93.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:22,377 INFO L168 Benchmark]: TraceAbstraction took 14386.92 ms. Allocated memory was 133.2 MB in the beginning and 341.3 MB in the end (delta: 208.1 MB). Free memory was 92.9 MB in the beginning and 321.9 MB in the end (delta: -229.0 MB). Peak memory consumption was 184.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:22,379 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.39 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 103.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.34 ms. Allocated memory is still 133.2 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 423.90 ms. Allocated memory is still 133.2 MB. Free memory was 102.6 MB in the beginning and 93.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14386.92 ms. Allocated memory was 133.2 MB in the beginning and 341.3 MB in the end (delta: 208.1 MB). Free memory was 92.9 MB in the beginning and 321.9 MB in the end (delta: -229.0 MB). Peak memory consumption was 184.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: 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, 14.3s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s 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.7s 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, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s 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...