java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:51:55,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:51:55,194 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:51:55,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:51:55,211 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:51:55,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:51:55,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:51:55,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:51:55,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:51:55,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:51:55,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:51:55,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:51:55,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:51:55,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:51:55,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:51:55,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:51:55,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:51:55,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:51:55,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:51:55,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:51:55,238 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:51:55,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:51:55,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:51:55,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:51:55,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:51:55,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:51:55,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:51:55,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:51:55,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:51:55,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:51:55,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:51:55,249 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:51:55,249 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:51:55,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:51:55,250 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:51:55,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:51:55,251 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-11 14:51:55,264 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:51:55,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:51:55,265 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:51:55,265 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:51:55,266 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:51:55,266 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:51:55,266 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:51:55,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:51:55,266 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:51:55,267 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 14:51:55,267 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 14:51:55,267 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:51:55,267 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:51:55,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:51:55,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:51:55,268 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:51:55,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:51:55,269 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:51:55,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:51:55,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:51:55,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:51:55,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:51:55,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:51:55,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:51:55,270 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:51:55,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:51:55,271 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:51:55,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:51:55,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:51:55,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:51:55,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:51:55,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:51:55,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:51:55,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:51:55,272 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:51:55,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:51:55,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:51:55,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:51:55,273 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:51:55,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:51:55,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:51:55,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:51:55,335 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:51:55,336 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:51:55,336 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 [2019-01-11 14:51:55,337 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-11 14:51:55,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:51:55,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:51:55,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:51:55,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:51:55,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:51:55,389 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,402 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:51:55,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:51:55,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:51:55,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:51:55,439 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,439 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,440 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,441 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,443 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,447 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,448 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 11.01 02:51:55" (1/1) ... [2019-01-11 14:51:55,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:51:55,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:51:55,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:51:55,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:51:55,452 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 11.01 02:51:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:51:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:51:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:51:55,713 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:51:55,713 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-11 14:51:55,715 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:51:55 BoogieIcfgContainer [2019-01-11 14:51:55,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:51:55,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:51:55,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:51:55,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:51:55,720 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 11.01 02:51:55" (1/2) ... [2019-01-11 14:51:55,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394687b5 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:51:55, skipping insertion in model container [2019-01-11 14:51:55,721 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 11.01 02:51:55" (2/2) ... [2019-01-11 14:51:55,723 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-11 14:51:55,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:51:55,743 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-11 14:51:55,762 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-11 14:51:55,798 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:51:55,798 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:51:55,798 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:51:55,798 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:51:55,798 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:51:55,799 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:51:55,799 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:51:55,799 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:51:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-11 14:51:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:51:55,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:51:55,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:51:55,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:51:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:51:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-11 14:51:55,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:51:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:51:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:55,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:51:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:51:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:51:56,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:51:56,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:51:56,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:51:56,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:51:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:51:56,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:51:56,029 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-11 14:51:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:51:56,254 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-11 14:51:56,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:51:56,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:51:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:51:56,267 INFO L225 Difference]: With dead ends: 17 [2019-01-11 14:51:56,268 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:51:56,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:51:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:51:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-11 14:51:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:51:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-11 14:51:56,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-11 14:51:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:51:56,304 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-11 14:51:56,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:51:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-11 14:51:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:51:56,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:51:56,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:51:56,305 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:51:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:51:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-11 14:51:56,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:51:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:56,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:51:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:56,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:51:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:51:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:51:56,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:51:56,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:51:56,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:51:56,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:51:56,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:51:56,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:51:56,370 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-11 14:51:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:51:56,448 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-11 14:51:56,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:51:56,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:51:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:51:56,450 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:51:56,450 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 14:51:56,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:51:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 14:51:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-11 14:51:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:51:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-11 14:51:56,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-11 14:51:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:51:56,458 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-11 14:51:56,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:51:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-11 14:51:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:51:56,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:51:56,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:51:56,460 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:51:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:51:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-11 14:51:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:51:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:56,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:51:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:56,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:51:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:51:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:51:56,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:51:56,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:51:56,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:51:56,579 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-11 14:51:56,629 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:51:56,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:51:57,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:51:57,645 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:51:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:51:57,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:51:57,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:51:57,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:51:57,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:51:57,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:51:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:51:57,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:51:57,855 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-11 14:51:57,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:57,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-11 14:51:58,074 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-11 14:51:58,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:58,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:58,093 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 [2019-01-11 14:51:58,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:51:58,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:51:58,181 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 [2019-01-11 14:51:58,197 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 [2019-01-11 14:51:58,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:51:58,214 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:51:58,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:51:58,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:51:58,497 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. [2019-01-11 14:51:58,498 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-11 14:51:58,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:58,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:51:58,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:51:58,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:51:58,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:51:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:51:58,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:51:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:51:58,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:51:58,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:51:58,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:51:58,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:51:58,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:51:58,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:51:58,711 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-11 14:51:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:51:58,808 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-11 14:51:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:51:58,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:51:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:51:58,811 INFO L225 Difference]: With dead ends: 13 [2019-01-11 14:51:58,811 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:51:58,812 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 [2019-01-11 14:51:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:51:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-11 14:51:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:51:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-11 14:51:58,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-11 14:51:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:51:58,817 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-11 14:51:58,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:51:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-11 14:51:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:51:58,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:51:58,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:51:58,818 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:51:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:51:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-11 14:51:58,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:51:58,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:58,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:51:58,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:51:58,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:51:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:51:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:51:58,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:51:58,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:51:58,870 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:51:58,870 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-11 14:51:58,873 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:51:58,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:51:59,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:51:59,234 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:51:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:51:59,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:51:59,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:51:59,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:51:59,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:51:59,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:51:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:51:59,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:51:59,382 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-11 14:51:59,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:59,420 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 [2019-01-11 14:51:59,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:59,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:59,508 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 [2019-01-11 14:51:59,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:51:59,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:51:59,557 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 [2019-01-11 14:51:59,564 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 [2019-01-11 14:51:59,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:51:59,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:51:59,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:51:59,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:51:59,662 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. [2019-01-11 14:51:59,662 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-11 14:51:59,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:51:59,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:51:59,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:51:59,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:51:59,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:52:00,142 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:52:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:00,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:00,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:00,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:52:00,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:00,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:52:00,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:52:00,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:52:00,337 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-11 14:52:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:00,597 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-11 14:52:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:52:00,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:52:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:00,599 INFO L225 Difference]: With dead ends: 24 [2019-01-11 14:52:00,599 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 14:52:00,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:52:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 14:52:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-11 14:52:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:52:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-11 14:52:00,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-11 14:52:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:00,605 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-11 14:52:00,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:52:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-11 14:52:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:52:00,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:00,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:52:00,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-11 14:52:00,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:00,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:00,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:52:00,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:52:00,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:52:00,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:52:00,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:52:00,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:52:00,662 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-11 14:52:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:00,689 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-11 14:52:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:52:00,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 14:52:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:00,691 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:52:00,691 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:52:00,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:52:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:52:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 14:52:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:52:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-11 14:52:00,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-11 14:52:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:00,697 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-11 14:52:00,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:52:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-11 14:52:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:52:00,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:00,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:52:00,698 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-11 14:52:00,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:00,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:00,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:00,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:00,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:00,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:00,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:00,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:52:00,787 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-11 14:52:00,790 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:00,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:01,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:01,111 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:52:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:01,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:01,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:01,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:01,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:01,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:01,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:01,204 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 [2019-01-11 14:52:01,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:52:01,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:01,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:01,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:52:01,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:01,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:01,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:01,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:01,285 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 [2019-01-11 14:52:01,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:01,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:01,318 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 [2019-01-11 14:52:01,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:01,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:01,339 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. [2019-01-11 14:52:01,339 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-11 14:52:01,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:01,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:52:01,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:01,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:01,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:52:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:01,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:01,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:01,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:52:01,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:01,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:52:01,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:52:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:52:01,478 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-11 14:52:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:01,653 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-11 14:52:01,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:52:01,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:52:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:01,654 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:52:01,654 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 14:52:01,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:52:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 14:52:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-11 14:52:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 14:52:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-11 14:52:01,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-11 14:52:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:01,660 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-11 14:52:01,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:52:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-11 14:52:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:52:01,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:01,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:52:01,661 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-11 14:52:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:01,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:01,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:01,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:01,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:01,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:01,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:01,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:52:01,728 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-11 14:52:01,730 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:01,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:02,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:02,193 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:52:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:02,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:02,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:02,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:02,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:02,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:02,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:02,347 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-11 14:52:02,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,389 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 [2019-01-11 14:52:02,649 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-11 14:52:02,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,662 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 [2019-01-11 14:52:02,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:02,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:02,697 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 [2019-01-11 14:52:02,701 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 [2019-01-11 14:52:02,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:52:02,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:02,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:02,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:02,739 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. [2019-01-11 14:52:02,739 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-11 14:52:02,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:52:02,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:02,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:02,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:52:02,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:02,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:52:02,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:02,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:02,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-11 14:52:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:02,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:52:02,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:02,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:52:02,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:52:02,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:52:02,987 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-11 14:52:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:03,217 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-11 14:52:03,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:52:03,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:52:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:03,219 INFO L225 Difference]: With dead ends: 35 [2019-01-11 14:52:03,219 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 14:52:03,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:52:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 14:52:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-11 14:52:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 14:52:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-11 14:52:03,226 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-11 14:52:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:03,226 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-11 14:52:03,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:52:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-11 14:52:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:52:03,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:03,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:52:03,227 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:03,228 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-11 14:52:03,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:03,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:03,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:03,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:03,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:03,264 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:52:03,264 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-11 14:52:03,265 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:03,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:03,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:03,526 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:52:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:03,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:03,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:03,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:03,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:03,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:03,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:03,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:52:03,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:52:03,725 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 [2019-01-11 14:52:03,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:03,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:03,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:03,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:03,859 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-11 14:52:03,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:03,940 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 [2019-01-11 14:52:03,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:03,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:03,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:52:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:04,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:04,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:52:04,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-11 14:52:04,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:52:04,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:52:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:52:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:52:04,174 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-11 14:52:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:04,384 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-11 14:52:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:52:04,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:52:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:04,386 INFO L225 Difference]: With dead ends: 30 [2019-01-11 14:52:04,387 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 14:52:04,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:52:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 14:52:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-11 14:52:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:52:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-11 14:52:04,395 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-11 14:52:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:04,395 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-11 14:52:04,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:52:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-11 14:52:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:52:04,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:04,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:52:04,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-11 14:52:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:04,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:04,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:04,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:04,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:04,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:52:04,547 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-11 14:52:04,548 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:04,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:05,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:05,026 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:52:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:05,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:05,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:05,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:05,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:05,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:05,188 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-11 14:52:05,203 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 [2019-01-11 14:52:05,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:52:05,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:52:05,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,344 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 [2019-01-11 14:52:05,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,372 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 [2019-01-11 14:52:05,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,378 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,390 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:52:05,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:52:05,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:05,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:52:05,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:05,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:52:05,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:05,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:05,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-11 14:52:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:05,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:05,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:05,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:52:05,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:05,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:52:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:52:05,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:52:05,581 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-11 14:52:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:05,910 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-11 14:52:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:52:05,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:52:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:05,912 INFO L225 Difference]: With dead ends: 48 [2019-01-11 14:52:05,912 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:52:05,913 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 [2019-01-11 14:52:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:52:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-11 14:52:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:52:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-11 14:52:05,922 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-11 14:52:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:05,922 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-11 14:52:05,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:52:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-11 14:52:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:52:05,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:05,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:52:05,923 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-11 14:52:05,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:05,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:05,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:05,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:05,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:05,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:05,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:52:05,962 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-11 14:52:05,964 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:05,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:08,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:08,347 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:52:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:08,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:08,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:08,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:08,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:08,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:08,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:08,400 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 [2019-01-11 14:52:08,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:08,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:08,427 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 [2019-01-11 14:52:08,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:08,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:08,442 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 [2019-01-11 14:52:08,447 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 [2019-01-11 14:52:08,453 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 [2019-01-11 14:52:08,453 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:08,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:08,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:08,492 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. [2019-01-11 14:52:08,493 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-11 14:52:08,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:08,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:52:08,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:08,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:08,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-11 14:52:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:08,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:08,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:08,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:52:08,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:08,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:52:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:52:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:52:08,602 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-11 14:52:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:08,784 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-11 14:52:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:52:08,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:52:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:08,786 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:52:08,786 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 14:52:08,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:52:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 14:52:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-11 14:52:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:52:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-11 14:52:08,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-11 14:52:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:08,795 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-11 14:52:08,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:52:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-11 14:52:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:52:08,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:08,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:52:08,796 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-11 14:52:08,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:08,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:08,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:08,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:08,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:08,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:08,926 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:52:08,926 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-11 14:52:08,928 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:08,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:09,125 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:09,125 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:52:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:09,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:09,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:09,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:09,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:09,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:09,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:09,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:52:09,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:52:09,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,260 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 [2019-01-11 14:52:09,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,286 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 [2019-01-11 14:52:09,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,301 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 [2019-01-11 14:52:09,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,314 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. [2019-01-11 14:52:09,314 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-11 14:52:09,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:52:09,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:09,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-11 14:52:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:09,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:09,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:52:09,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-11 14:52:09,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:52:09,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:52:09,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:52:09,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:52:09,502 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-11 14:52:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:09,549 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-11 14:52:09,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:52:09,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:52:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:09,550 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:52:09,550 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 14:52:09,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:52:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 14:52:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-11 14:52:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 14:52:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-11 14:52:09,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-11 14:52:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:09,560 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-11 14:52:09,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:52:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-11 14:52:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:52:09,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:09,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:52:09,561 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-11 14:52:09,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:09,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:09,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:52:09,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:09,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:09,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:52:09,600 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-11 14:52:09,601 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:09,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:09,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:09,888 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:52:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:09,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:09,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:09,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:09,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:09,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:09,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:09,931 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 [2019-01-11 14:52:09,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 [2019-01-11 14:52:09,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:52:09,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:09,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:09,988 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 [2019-01-11 14:52:10,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,012 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 [2019-01-11 14:52:10,012 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,040 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:52:10,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:52:10,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:10,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:52:10,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,109 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:52:10,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:52:10,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:10,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-11 14:52:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:10,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:10,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:10,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:52:10,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:10,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:52:10,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:52:10,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:52:10,172 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-11 14:52:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:10,315 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-11 14:52:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:52:10,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-11 14:52:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:10,318 INFO L225 Difference]: With dead ends: 38 [2019-01-11 14:52:10,318 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 14:52:10,319 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 [2019-01-11 14:52:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 14:52:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-11 14:52:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:52:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-11 14:52:10,327 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-11 14:52:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:10,328 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-11 14:52:10,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:52:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-11 14:52:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:52:10,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:10,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:52:10,329 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:10,329 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-11 14:52:10,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:10,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:10,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:10,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:10,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:10,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:10,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:10,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:52:10,404 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-11 14:52:10,405 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:10,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:10,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:10,695 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:52:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:10,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:10,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:10,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:10,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:10,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:10,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:10,830 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 14:52:10,845 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 [2019-01-11 14:52:10,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,856 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 [2019-01-11 14:52:10,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:52:10,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 14:52:10,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,889 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. [2019-01-11 14:52:10,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-11 14:52:10,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:52:10,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 14:52:10,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:10,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:52:10,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:10,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:10,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-11 14:52:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:10,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:11,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:52:11,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:11,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:52:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:52:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:52:11,055 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-11 14:52:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:11,368 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-11 14:52:11,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:52:11,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:52:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:11,370 INFO L225 Difference]: With dead ends: 45 [2019-01-11 14:52:11,370 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:52:11,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:52:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:52:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-11 14:52:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:52:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-11 14:52:11,381 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-11 14:52:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:11,382 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-11 14:52:11,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:52:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-11 14:52:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:52:11,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:11,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:52:11,383 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-11 14:52:11,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:11,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:11,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:11,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:11,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:11,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:52:11,446 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-11 14:52:11,448 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:11,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:11,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:11,679 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:52:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:11,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:11,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:11,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:11,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:11,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:11,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:52:11,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:52:11,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,746 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 [2019-01-11 14:52:11,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,786 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 [2019-01-11 14:52:11,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,797 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 [2019-01-11 14:52:11,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,818 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. [2019-01-11 14:52:11,819 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-11 14:52:11,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,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 21 treesize of output 15 [2019-01-11 14:52:11,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 14:52:11,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:11,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:52:11,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:11,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:11,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-11 14:52:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:11,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:12,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:12,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:52:12,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:12,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:52:12,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:52:12,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:52:12,027 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-11 14:52:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:12,183 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-11 14:52:12,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:52:12,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:52:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:12,185 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:52:12,185 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 14:52:12,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:52:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 14:52:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-11 14:52:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 14:52:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-11 14:52:12,197 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-11 14:52:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:12,197 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-11 14:52:12,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:52:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-11 14:52:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:52:12,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:12,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:52:12,201 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:12,201 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-11 14:52:12,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:12,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:12,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:12,330 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-11 14:52:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:12,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:12,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:12,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:52:12,370 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-11 14:52:12,373 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:12,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:12,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:12,705 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:52:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:12,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:12,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:12,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:12,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:12,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:12,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:12,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,761 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 [2019-01-11 14:52:12,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,788 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 [2019-01-11 14:52:12,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,818 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 [2019-01-11 14:52:12,826 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 [2019-01-11 14:52:12,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:52:12,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,857 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:52:12,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:52:12,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:12,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:52:12,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,910 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:52:12,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:52:12,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:12,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-11 14:52:12,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:12,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:52:12,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:12,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:12,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-11 14:52:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:12,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:13,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:13,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:52:13,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:13,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:52:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:52:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:52:13,090 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-11 14:52:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:13,282 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-11 14:52:13,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:52:13,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:52:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:13,284 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:52:13,284 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 14:52:13,285 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 [2019-01-11 14:52:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 14:52:13,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-11 14:52:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:52:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-11 14:52:13,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-11 14:52:13,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:13,297 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-11 14:52:13,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:52:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-11 14:52:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:52:13,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:13,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:52:13,298 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:13,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:13,298 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-11 14:52:13,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:13,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:13,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:13,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:13,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:13,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:13,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:13,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:52:13,560 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-11 14:52:13,568 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:13,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:13,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:13,796 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:52:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:13,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:13,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:13,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:13,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:13,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:13,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:13,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:52:13,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:52:13,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:13,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:13,871 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 [2019-01-11 14:52:13,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:13,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:13,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:13,905 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 [2019-01-11 14:52:13,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:13,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:13,925 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 [2019-01-11 14:52:13,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:13,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:13,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:13,998 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-11 14:52:14,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,034 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 [2019-01-11 14:52:14,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:52:14,061 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. [2019-01-11 14:52:14,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-11 14:52:14,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,096 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 [2019-01-11 14:52:14,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:14,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:14,123 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:52:14,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:52:14,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:14,139 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. [2019-01-11 14:52:14,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-11 14:52:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:14,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:14,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:14,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-11 14:52:14,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:14,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:52:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:52:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:52:14,268 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-11 14:52:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:14,550 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-11 14:52:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:52:14,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:52:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:14,551 INFO L225 Difference]: With dead ends: 28 [2019-01-11 14:52:14,551 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 14:52:14,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:52:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 14:52:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-11 14:52:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 14:52:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-11 14:52:14,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-11 14:52:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-11 14:52:14,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:52:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-11 14:52:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:52:14,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:52:14,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:52:14,561 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:52:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-11 14:52:14,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:52:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:14,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:52:14,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:52:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:52:14,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:14,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:52:14,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:52:14,646 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-11 14:52:14,647 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:52:14,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:52:14,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:52:14,961 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:52:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:52:14,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:52:14,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:52:14,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:52:14,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:52:14,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:52:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:52:14,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:52:15,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,094 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 [2019-01-11 14:52:15,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,117 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 [2019-01-11 14:52:15,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,133 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 [2019-01-11 14:52:15,135 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 [2019-01-11 14:52:15,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:52:15,139 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,165 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:52:15,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:52:15,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:15,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:52:15,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:52:15,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,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. [2019-01-11 14:52:15,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-11 14:52:15,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,252 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:52:15,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:52:15,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:52:15,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:52:15,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:52:15,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-11 14:52:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:15,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:52:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:52:15,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:52:15,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:52:15,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:52:15,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:52:15,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:52:15,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:52:15,343 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-11 14:52:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:52:15,846 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-11 14:52:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:52:15,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:52:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:52:15,847 INFO L225 Difference]: With dead ends: 22 [2019-01-11 14:52:15,847 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:52:15,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:52:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:52:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:52:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:52:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:52:15,849 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-11 14:52:15,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:52:15,849 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:52:15,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:52:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:52:15,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:52:15,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:52:15,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:52:15,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:52:15,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:52:15,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:52:16,000 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-11 14:52:17,224 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-11 14:52:17,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:52:17,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:52:17,227 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)))) [2019-01-11 14:52:17,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-11 14:52:17,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-11 14:52:17,228 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-11 14:52:17,228 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-11 14:52:17,228 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-11 14:52:17,228 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-11 14:52:17,237 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:52:17 BoogieIcfgContainer [2019-01-11 14:52:17,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:52:17,238 INFO L168 Benchmark]: Toolchain (without parser) took 21867.85 ms. Allocated memory was 140.5 MB in the beginning and 518.5 MB in the end (delta: 378.0 MB). Free memory was 105.7 MB in the beginning and 201.2 MB in the end (delta: -95.5 MB). Peak memory consumption was 282.5 MB. Max. memory is 7.1 GB. [2019-01-11 14:52:17,239 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:52:17,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.16 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 103.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:52:17,239 INFO L168 Benchmark]: Boogie Preprocessor took 22.83 ms. Allocated memory is still 140.5 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:52:17,239 INFO L168 Benchmark]: RCFGBuilder took 264.85 ms. Allocated memory is still 140.5 MB. Free memory was 102.2 MB in the beginning and 92.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-01-11 14:52:17,240 INFO L168 Benchmark]: TraceAbstraction took 21521.49 ms. Allocated memory was 140.5 MB in the beginning and 518.5 MB in the end (delta: 378.0 MB). Free memory was 92.1 MB in the beginning and 201.2 MB in the end (delta: -109.2 MB). Peak memory consumption was 268.8 MB. Max. memory is 7.1 GB. [2019-01-11 14:52:17,242 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.20 ms. Allocated memory is still 140.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.16 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 103.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.83 ms. Allocated memory is still 140.5 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 264.85 ms. Allocated memory is still 140.5 MB. Free memory was 102.2 MB in the beginning and 92.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21521.49 ms. Allocated memory was 140.5 MB in the beginning and 518.5 MB in the end (delta: 378.0 MB). Free memory was 92.1 MB in the beginning and 201.2 MB in the end (delta: -109.2 MB). Peak memory consumption was 268.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - PositiveResult [Line: 37]: 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, 21.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.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.7s 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, 7.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, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s 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...