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-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:51:35,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:51:35,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:51:35,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:51:35,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:51:35,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:51:35,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:51:35,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:51:35,186 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:51:35,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:51:35,192 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:51:35,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:51:35,193 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:51:35,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:51:35,196 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:51:35,197 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:51:35,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:51:35,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:51:35,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:51:35,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:51:35,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:51:35,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:51:35,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:51:35,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:51:35,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:51:35,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:51:35,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:51:35,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:51:35,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:51:35,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:51:35,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:51:35,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:51:35,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:51:35,236 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:51:35,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:51:35,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:51:35,239 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 [2018-12-24 13:51:35,265 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:51:35,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:51:35,266 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:51:35,266 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:51:35,266 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:51:35,267 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:51:35,267 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:51:35,267 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:51:35,267 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:51:35,267 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:51:35,268 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:51:35,268 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:51:35,268 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:51:35,268 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:51:35,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:51:35,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:51:35,270 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:51:35,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:51:35,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:51:35,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:51:35,270 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:51:35,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:51:35,271 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:51:35,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:51:35,271 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:51:35,271 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:51:35,271 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:51:35,272 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:51:35,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:51:35,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:51:35,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:51:35,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:35,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:51:35,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:51:35,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:51:35,273 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:51:35,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:51:35,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:51:35,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:51:35,274 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:51:35,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:51:35,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:51:35,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:51:35,344 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:51:35,345 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:51:35,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2018-12-24 13:51:35,346 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2018-12-24 13:51:35,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:51:35,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:51:35,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:35,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:51:35,395 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:51:35,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:35,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:51:35,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:51:35,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:51:35,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/1) ... [2018-12-24 13:51:35,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:51:35,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:51:35,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:51:35,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:51:35,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:51:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:51:35,835 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:51:35,836 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-24 13:51:35,836 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:35 BoogieIcfgContainer [2018-12-24 13:51:35,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:51:35,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:51:35,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:51:35,840 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:51:35,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:35" (1/2) ... [2018-12-24 13:51:35,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc7ffaf and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:51:35, skipping insertion in model container [2018-12-24 13:51:35,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:35" (2/2) ... [2018-12-24 13:51:35,844 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2018-12-24 13:51:35,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:51:35,863 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-24 13:51:35,883 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-24 13:51:35,918 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:51:35,918 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:51:35,918 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:51:35,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:51:35,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:51:35,919 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:51:35,919 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:51:35,919 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:51:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-24 13:51:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 13:51:35,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:35,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 13:51:35,945 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:35,956 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2018-12-24 13:51:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:36,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:36,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:36,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:36,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:36,188 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-24 13:51:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:36,410 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-24 13:51:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:36,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 13:51:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:36,433 INFO L225 Difference]: With dead ends: 17 [2018-12-24 13:51:36,433 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:51:36,440 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 [2018-12-24 13:51:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:51:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-12-24 13:51:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 13:51:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-24 13:51:36,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2018-12-24 13:51:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:36,472 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-24 13:51:36,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-24 13:51:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:36,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:36,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:36,473 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:36,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:36,474 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2018-12-24 13:51:36,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:36,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:36,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:36,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:36,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:36,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:36,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:36,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:36,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:36,514 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-12-24 13:51:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:36,613 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-24 13:51:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:36,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 13:51:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:36,615 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:51:36,615 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 13:51:36,617 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 [2018-12-24 13:51:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 13:51:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-24 13:51:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:51:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-12-24 13:51:36,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2018-12-24 13:51:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:36,621 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-12-24 13:51:36,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2018-12-24 13:51:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:36,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:36,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:36,623 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2018-12-24 13:51:36,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:36,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:36,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:36,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:36,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:36,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:36,731 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2018-12-24 13:51:36,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:36,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:36,852 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:36,853 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:36,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:36,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:36,863 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 [2018-12-24 13:51:36,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:36,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:36,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:37,067 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-24 13:51:37,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:37,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:37,256 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-24 13:51:37,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:37,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:37,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:37,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:37,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:37,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:37,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:37,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:37,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:37,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:37,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:37,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:37,493 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:37,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:37,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:37,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:37,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:37,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:37,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:37,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:37,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:51:37,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:37,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:37,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:37,804 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2018-12-24 13:51:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:37,895 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2018-12-24 13:51:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:37,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 13:51:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:37,897 INFO L225 Difference]: With dead ends: 13 [2018-12-24 13:51:37,897 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:51:37,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:51:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-24 13:51:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 13:51:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-12-24 13:51:37,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2018-12-24 13:51:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:37,905 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2018-12-24 13:51:37,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2018-12-24 13:51:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:37,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:37,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:37,907 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2018-12-24 13:51:37,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:37,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:37,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:37,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:37,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:37,965 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2018-12-24 13:51:37,968 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:37,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:37,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:37,974 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:37,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:37,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:37,975 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 [2018-12-24 13:51:37,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:37,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:38,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:38,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:38,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:38,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:38,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:38,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:38,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2018-12-24 13:51:38,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:38,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:38,272 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,285 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:38,323 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:38,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:38,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:38,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:38,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:38,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:38,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:38,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:38,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:38,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:38,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:38,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:38,771 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2018-12-24 13:51:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:39,050 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2018-12-24 13:51:39,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:39,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:51:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:39,052 INFO L225 Difference]: With dead ends: 24 [2018-12-24 13:51:39,053 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 13:51:39,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:51:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 13:51:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-12-24 13:51:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:51:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-12-24 13:51:39,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2018-12-24 13:51:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:39,059 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2018-12-24 13:51:39,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2018-12-24 13:51:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:39,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:39,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:39,060 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2018-12-24 13:51:39,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:39,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:39,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:39,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:39,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:39,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:39,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:39,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:39,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:39,097 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2018-12-24 13:51:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:39,228 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2018-12-24 13:51:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:39,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 13:51:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:39,229 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:51:39,229 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:51:39,230 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 [2018-12-24 13:51:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:51:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-24 13:51:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-24 13:51:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-12-24 13:51:39,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2018-12-24 13:51:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:39,234 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2018-12-24 13:51:39,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2018-12-24 13:51:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:39,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:39,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:39,235 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:39,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:39,235 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2018-12-24 13:51:39,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:39,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:39,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:39,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:39,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:39,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:39,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:39,289 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2018-12-24 13:51:39,291 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:39,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:39,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:39,300 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:39,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:39,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:39,301 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 [2018-12-24 13:51:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:39,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:39,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:39,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:39,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:39,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:39,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:39,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:39,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:39,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:39,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:39,488 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:39,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:39,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:39,511 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:39,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:39,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:39,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:39,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:39,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:39,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:39,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:39,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:39,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:39,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:39,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:39,653 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2018-12-24 13:51:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:39,801 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2018-12-24 13:51:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:39,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:51:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:39,802 INFO L225 Difference]: With dead ends: 21 [2018-12-24 13:51:39,803 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 13:51:39,803 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 [2018-12-24 13:51:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 13:51:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-24 13:51:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-24 13:51:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2018-12-24 13:51:39,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2018-12-24 13:51:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:39,810 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2018-12-24 13:51:39,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2018-12-24 13:51:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:39,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:39,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:39,811 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2018-12-24 13:51:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:39,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:39,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:39,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:39,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:39,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:39,872 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2018-12-24 13:51:39,875 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:39,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:39,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:39,881 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:39,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:39,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:39,882 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 [2018-12-24 13:51:39,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:39,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:39,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:39,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:39,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:39,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:39,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:40,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:40,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:40,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:40,069 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:40,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:40,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:40,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:40,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:40,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:40,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:40,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:40,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:40,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:40,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-24 13:51:40,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:40,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-12-24 13:51:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:40,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:40,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:40,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:40,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:40,323 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2018-12-24 13:51:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:40,548 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2018-12-24 13:51:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:40,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:40,549 INFO L225 Difference]: With dead ends: 35 [2018-12-24 13:51:40,550 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 13:51:40,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 13:51:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2018-12-24 13:51:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-24 13:51:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2018-12-24 13:51:40,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2018-12-24 13:51:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:40,557 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2018-12-24 13:51:40,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2018-12-24 13:51:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:40,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:40,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:40,558 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:40,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2018-12-24 13:51:40,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:40,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:40,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:40,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:40,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:40,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:40,613 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:40,614 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2018-12-24 13:51:40,615 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:40,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:40,620 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:40,620 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:40,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:40,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:40,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:40,621 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 [2018-12-24 13:51:40,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:40,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:40,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:40,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:40,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:40,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 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 [2018-12-24 13:51:40,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:40,683 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2018-12-24 13:51:40,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:40,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-24 13:51:40,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:40,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 13:51:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:40,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2018-12-24 13:51:40,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:40,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:40,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:40,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:51:40,771 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2018-12-24 13:51:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:40,831 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2018-12-24 13:51:40,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:40,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:51:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:40,833 INFO L225 Difference]: With dead ends: 30 [2018-12-24 13:51:40,833 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 13:51:40,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:51:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 13:51:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-12-24 13:51:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 13:51:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2018-12-24 13:51:40,842 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2018-12-24 13:51:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:40,842 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2018-12-24 13:51:40,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2018-12-24 13:51:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:40,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:40,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:40,843 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:40,844 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2018-12-24 13:51:40,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:40,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:40,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:40,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:40,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:40,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:40,974 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:40,974 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2018-12-24 13:51:40,975 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:40,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:40,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:40,980 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:40,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:40,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:40,981 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 [2018-12-24 13:51:40,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:40,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:40,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:41,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:41,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:41,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:41,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:41,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:41,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,180 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:41,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:41,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:41,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:41,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-24 13:51:41,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:41,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-24 13:51:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:41,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:41,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:41,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:51:41,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:41,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:41,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:51:41,357 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2018-12-24 13:51:41,658 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-24 13:51:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:41,766 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2018-12-24 13:51:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:41,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:41,768 INFO L225 Difference]: With dead ends: 48 [2018-12-24 13:51:41,769 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:51:41,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:51:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-12-24 13:51:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:51:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2018-12-24 13:51:41,782 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2018-12-24 13:51:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:41,782 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2018-12-24 13:51:41,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2018-12-24 13:51:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:41,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:41,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:41,784 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2018-12-24 13:51:41,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:41,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:41,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:41,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:41,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:41,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:41,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:41,823 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:41,823 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2018-12-24 13:51:41,824 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:41,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:41,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:41,829 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:41,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:41,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:41,830 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 [2018-12-24 13:51:41,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:41,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:41,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:41,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-24 13:51:41,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:41,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-12-24 13:51:41,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:41,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:42,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:42,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-24 13:51:42,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:42,044 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2018-12-24 13:51:42,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:42,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:42,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:42,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-12-24 13:51:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:42,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:42,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:42,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:42,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:42,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:42,380 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2018-12-24 13:51:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:42,549 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2018-12-24 13:51:42,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:42,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:51:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:42,550 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:51:42,550 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 13:51:42,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:51:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 13:51:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-12-24 13:51:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:51:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2018-12-24 13:51:42,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2018-12-24 13:51:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:42,562 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2018-12-24 13:51:42,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2018-12-24 13:51:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:42,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:42,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:42,563 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2018-12-24 13:51:42,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:42,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:42,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:42,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:42,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:42,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:42,717 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2018-12-24 13:51:42,718 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:42,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:42,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:42,723 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:42,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:42,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:42,724 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 [2018-12-24 13:51:42,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:42,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:42,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:42,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:42,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:42,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:42,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:42,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-24 13:51:42,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,903 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-24 13:51:42,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:42,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:42,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-12-24 13:51:42,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,961 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:42,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:42,974 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2018-12-24 13:51:43,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:43,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:43,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-12-24 13:51:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:43,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:43,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:43,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2018-12-24 13:51:43,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:43,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:43,068 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2018-12-24 13:51:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:43,138 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2018-12-24 13:51:43,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:43,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:51:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:43,140 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:51:43,140 INFO L226 Difference]: Without dead ends: 36 [2018-12-24 13:51:43,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-24 13:51:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-24 13:51:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 13:51:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2018-12-24 13:51:43,151 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2018-12-24 13:51:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:43,151 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2018-12-24 13:51:43,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2018-12-24 13:51:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:43,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:43,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:43,153 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2018-12-24 13:51:43,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:43,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:43,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:51:43,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:43,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:43,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:43,203 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2018-12-24 13:51:43,204 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:43,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:43,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:43,208 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:43,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:43,209 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 [2018-12-24 13:51:43,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:43,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:43,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:43,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:43,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:43,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:43,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:43,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:43,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,380 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:43,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:43,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:43,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:43,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,448 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:43,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2018-12-24 13:51:43,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:43,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-12-24 13:51:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:43,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:43,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:43,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:51:43,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:43,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:51:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:51:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:51:43,522 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2018-12-24 13:51:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:43,779 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2018-12-24 13:51:43,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:51:43,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2018-12-24 13:51:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:43,781 INFO L225 Difference]: With dead ends: 38 [2018-12-24 13:51:43,781 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:51:43,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:51:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-24 13:51:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:51:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2018-12-24 13:51:43,793 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2018-12-24 13:51:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:43,793 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2018-12-24 13:51:43,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:51:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2018-12-24 13:51:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:43,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:43,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:43,796 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:43,796 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2018-12-24 13:51:43,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:43,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:43,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:43,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:43,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:43,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:43,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:43,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:43,878 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2018-12-24 13:51:43,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:43,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:43,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:43,885 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:43,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:43,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:43,885 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 [2018-12-24 13:51:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:43,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:43,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:43,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-24 13:51:43,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:43,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:43,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-24 13:51:43,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,965 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:43,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:43,974 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-24 13:51:43,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:43,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:43,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-24 13:51:44,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-24 13:51:44,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:44,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2018-12-24 13:51:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:44,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:44,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:44,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:44,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:44,142 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2018-12-24 13:51:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:44,466 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2018-12-24 13:51:44,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:44,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:51:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:44,468 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:51:44,468 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:51:44,469 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 [2018-12-24 13:51:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:51:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-12-24 13:51:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:51:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2018-12-24 13:51:44,481 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2018-12-24 13:51:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:44,481 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2018-12-24 13:51:44,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2018-12-24 13:51:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:44,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:44,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:44,482 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2018-12-24 13:51:44,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:44,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:44,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:44,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:44,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:44,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:44,538 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2018-12-24 13:51:44,540 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:44,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:44,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:44,545 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:44,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:44,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:44,546 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 [2018-12-24 13:51:44,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:44,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:44,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:44,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2018-12-24 13:51:44,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:44,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-24 13:51:44,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,601 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-24 13:51:44,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-12-24 13:51:44,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:44,714 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2018-12-24 13:51:44,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:44,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-24 13:51:44,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:44,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-24 13:51:44,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:44,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:44,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2018-12-24 13:51:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:44,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:44,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:44,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:44,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:44,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:44,836 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2018-12-24 13:51:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:44,984 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2018-12-24 13:51:44,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:44,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:51:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:44,989 INFO L225 Difference]: With dead ends: 52 [2018-12-24 13:51:44,989 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 13:51:44,989 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 [2018-12-24 13:51:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 13:51:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-12-24 13:51:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 13:51:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2018-12-24 13:51:45,008 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2018-12-24 13:51:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:45,008 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2018-12-24 13:51:45,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2018-12-24 13:51:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:45,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:45,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:45,010 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2018-12-24 13:51:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:45,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:45,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:45,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:45,217 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2018-12-24 13:51:45,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:45,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:45,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:45,222 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:51:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:45,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:45,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:45,223 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 [2018-12-24 13:51:45,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:45,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:45,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:45,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:45,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:45,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:45,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:45,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:45,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,372 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:45,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:45,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:45,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:45,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,440 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:45,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:45,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:45,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2018-12-24 13:51:45,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:45,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-24 13:51:45,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:45,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:45,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-12-24 13:51:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:45,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:45,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:45,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:51:45,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:45,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:51:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:51:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:51:45,575 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2018-12-24 13:51:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:45,854 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2018-12-24 13:51:45,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:51:45,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:51:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:45,856 INFO L225 Difference]: With dead ends: 49 [2018-12-24 13:51:45,856 INFO L226 Difference]: Without dead ends: 48 [2018-12-24 13:51:45,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:51:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-24 13:51:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2018-12-24 13:51:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 13:51:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2018-12-24 13:51:45,866 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2018-12-24 13:51:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:45,866 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2018-12-24 13:51:45,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:51:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2018-12-24 13:51:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:51:45,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:45,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:51:45,867 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2018-12-24 13:51:45,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:46,056 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-12-24 13:51:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:46,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:46,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:46,204 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:51:46,204 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2018-12-24 13:51:46,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:46,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:46,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:46,211 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:46,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:46,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:46,212 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 [2018-12-24 13:51:46,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:46,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:46,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:46,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:46,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:46,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-24 13:51:46,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-24 13:51:46,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-12-24 13:51:46,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,309 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2018-12-24 13:51:46,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:46,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-24 13:51:46,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-24 13:51:46,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-12-24 13:51:46,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-12-24 13:51:46,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:46,427 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:46,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:46,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:46,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-24 13:51:46,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2018-12-24 13:51:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:46,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:46,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:46,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2018-12-24 13:51:46,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:46,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:51:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:51:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:46,546 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2018-12-24 13:51:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:46,844 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2018-12-24 13:51:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:51:46,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:51:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:46,846 INFO L225 Difference]: With dead ends: 28 [2018-12-24 13:51:46,846 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 13:51:46,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:51:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 13:51:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-24 13:51:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 13:51:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2018-12-24 13:51:46,855 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2018-12-24 13:51:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:46,855 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2018-12-24 13:51:46,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:51:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2018-12-24 13:51:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:51:46,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:46,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:51:46,856 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:46,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2018-12-24 13:51:46,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:46,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:46,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:46,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:51:46,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:46,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:46,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:51:46,954 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2018-12-24 13:51:46,955 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:46,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:46,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:46,959 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:51:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:46,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:46,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:46,960 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 [2018-12-24 13:51:46,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:46,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:46,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:47,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-24 13:51:47,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-24 13:51:47,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:47,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:47,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:47,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,134 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-24 13:51:47,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:47,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:47,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-12-24 13:51:47,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-24 13:51:47,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:47,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-12-24 13:51:47,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,232 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:47,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:47,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-24 13:51:47,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:47,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2018-12-24 13:51:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:47,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:47,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:47,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:51:47,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:47,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:51:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:51:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:51:47,336 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2018-12-24 13:51:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:47,609 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2018-12-24 13:51:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:51:47,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:51:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:47,610 INFO L225 Difference]: With dead ends: 22 [2018-12-24 13:51:47,610 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:51:47,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:51:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:51:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:51:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:51:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:51:47,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2018-12-24 13:51:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:47,612 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:51:47,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:51:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:51:47,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:51:47,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:51:47,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:51:47,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:51:47,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:51:47,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:51:47,768 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2018-12-24 13:51:49,980 WARN L181 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2018-12-24 13:51:49,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:49,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2018-12-24 13:51:49,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:49,984 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2018-12-24 13:51:49,984 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2018-12-24 13:51:49,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2018-12-24 13:51:49,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2018-12-24 13:51:49,984 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-24 13:51:49,985 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-12-24 13:51:49,995 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:51:49 BoogieIcfgContainer [2018-12-24 13:51:49,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:51:49,996 INFO L168 Benchmark]: Toolchain (without parser) took 14603.73 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 819.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -535.9 MB). Peak memory consumption was 283.5 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:49,997 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:49,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:49,997 INFO L168 Benchmark]: Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:49,998 INFO L168 Benchmark]: RCFGBuilder took 356.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:49,998 INFO L168 Benchmark]: TraceAbstraction took 14158.36 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 819.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -557.1 MB). Peak memory consumption was 262.4 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:49,999 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 356.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14158.36 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 819.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -557.1 MB). Peak memory consumption was 262.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: 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: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 14.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...