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-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:53:17,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:17,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:17,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:17,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:17,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:17,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:17,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:17,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:17,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:17,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:17,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:17,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:17,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:17,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:17,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:17,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:17,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:17,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:17,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:17,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:17,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:17,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:17,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:17,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:17,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:17,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:17,183 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:17,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:17,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:17,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:17,189 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:17,189 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:17,189 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:17,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:17,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:17,191 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-03-04 16:53:17,203 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:17,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:17,204 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:17,205 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:17,205 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:17,205 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:17,205 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:17,205 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:17,206 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:17,206 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:17,206 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:17,206 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:17,206 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:17,207 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:17,207 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:17,207 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:17,208 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:17,208 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:17,208 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:17,208 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:17,208 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:17,208 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:17,209 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:17,209 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:17,209 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:17,209 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:17,209 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:17,210 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:17,210 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:17,210 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:17,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:17,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:17,211 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:17,211 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:17,211 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:17,211 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:17,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:17,211 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:17,212 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:17,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:17,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:17,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:17,270 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:17,271 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:17,271 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-03-04 16:53:17,272 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-03-04 16:53:17,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:17,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:17,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:17,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:17,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:17,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:17,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:17,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:17,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:17,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... [2019-03-04 16:53:17,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:17,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:17,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:17,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:17,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:17,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:53:17,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:53:17,732 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:53:17,733 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-03-04 16:53:17,734 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:17 BoogieIcfgContainer [2019-03-04 16:53:17,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:17,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:17,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:17,739 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:17,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:17" (1/2) ... [2019-03-04 16:53:17,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405da538 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:17, skipping insertion in model container [2019-03-04 16:53:17,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:17" (2/2) ... [2019-03-04 16:53:17,743 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-03-04 16:53:17,755 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:17,766 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-03-04 16:53:17,785 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-03-04 16:53:17,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:17,822 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:17,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:17,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:17,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:17,823 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:17,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:17,823 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-03-04 16:53:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:53:17,855 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:17,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:53:17,859 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-03-04 16:53:17,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:17,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:17,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:18,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:18,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:18,104 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-03-04 16:53:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:18,292 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-03-04 16:53:18,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:18,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:53:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:18,308 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:53:18,308 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:53:18,311 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-03-04 16:53:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:53:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-03-04 16:53:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:53:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-03-04 16:53:18,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-03-04 16:53:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:18,349 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-03-04 16:53:18,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-03-04 16:53:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:18,350 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:18,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:18,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:18,351 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-03-04 16:53:18,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:18,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:18,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:18,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:18,402 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-03-04 16:53:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:18,462 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-03-04 16:53:18,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:18,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:18,464 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:53:18,464 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:53:18,465 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-03-04 16:53:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:53:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-03-04 16:53:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:53:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-03-04 16:53:18,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-03-04 16:53:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:18,469 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-03-04 16:53:18,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-03-04 16:53:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:18,470 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:18,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:18,471 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-03-04 16:53:18,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:18,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:18,607 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:18,609 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-03-04 16:53:18,681 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:18,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:26,168 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:26,170 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:53:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:26,176 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:26,762 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 71.43% of their original sizes. [2019-03-04 16:53:26,762 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:27,078 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-03-04 16:53:27,078 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:27,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:27,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-03-04 16:53:27,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:27,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:27,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:27,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:27,081 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 3 states. [2019-03-04 16:53:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:27,252 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2019-03-04 16:53:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:27,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:27,254 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:53:27,254 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:53:27,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:53:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-03-04 16:53:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:53:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-03-04 16:53:27,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-03-04 16:53:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:27,259 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-03-04 16:53:27,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-03-04 16:53:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:27,260 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:27,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:27,260 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:27,261 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-03-04 16:53:27,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:27,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:27,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:27,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:27,516 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:53:27,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-03-04 16:53:27,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:27,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:27,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:27,560 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-03-04 16:53:27,562 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:27,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:31,515 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:31,516 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:53:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:31,516 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:31,845 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 64.29% of their original sizes. [2019-03-04 16:53:31,846 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:32,067 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-03-04 16:53:32,067 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:32,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-03-04 16:53:32,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:32,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:32,070 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 4 states. [2019-03-04 16:53:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:32,680 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2019-03-04 16:53:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:32,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:53:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:32,681 INFO L225 Difference]: With dead ends: 16 [2019-03-04 16:53:32,681 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:53:32,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:53:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2019-03-04 16:53:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:53:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2019-03-04 16:53:32,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 3 [2019-03-04 16:53:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:32,686 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 22 transitions. [2019-03-04 16:53:32,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2019-03-04 16:53:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:32,687 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:32,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:32,687 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:32,688 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-03-04 16:53:32,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:32,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:32,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:32,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:32,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:32,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:32,741 INFO L87 Difference]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2019-03-04 16:53:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:32,783 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2019-03-04 16:53:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:32,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:53:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:32,784 INFO L225 Difference]: With dead ends: 14 [2019-03-04 16:53:32,784 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:53:32,785 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-03-04 16:53:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:53:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-03-04 16:53:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:53:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-03-04 16:53:32,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 4 [2019-03-04 16:53:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:32,790 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-03-04 16:53:32,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-03-04 16:53:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:32,790 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:32,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:32,791 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:32,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:32,791 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-03-04 16:53:32,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:32,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:32,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:33,025 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:53:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:33,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:33,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:33,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:33,071 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-03-04 16:53:33,074 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:33,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:36,197 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:36,198 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-03-04 16:53:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:36,198 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:36,583 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-03-04 16:53:36,583 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:36,944 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:53:36,945 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:36,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:36,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-03-04 16:53:36,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:36,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:36,947 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 4 states. [2019-03-04 16:53:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:37,631 INFO L93 Difference]: Finished difference Result 16 states and 28 transitions. [2019-03-04 16:53:37,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:37,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:53:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:37,635 INFO L225 Difference]: With dead ends: 16 [2019-03-04 16:53:37,636 INFO L226 Difference]: Without dead ends: 15 [2019-03-04 16:53:37,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-03-04 16:53:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-03-04 16:53:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:53:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2019-03-04 16:53:37,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 4 [2019-03-04 16:53:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:37,647 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 25 transitions. [2019-03-04 16:53:37,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 25 transitions. [2019-03-04 16:53:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:37,648 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:37,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:37,649 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:37,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:37,649 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-03-04 16:53:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:37,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:37,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:38,057 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-03-04 16:53:38,417 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:53:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:38,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:38,525 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:38,525 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-03-04 16:53:38,529 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:38,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:46,804 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:46,804 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:46,805 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:47,312 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-03-04 16:53:47,313 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:47,630 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:53:47,630 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:47,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:47,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-03-04 16:53:47,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:47,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:47,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:47,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:47,632 INFO L87 Difference]: Start difference. First operand 12 states and 25 transitions. Second operand 4 states. [2019-03-04 16:53:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:53,004 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. [2019-03-04 16:53:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:53,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:53:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:53,005 INFO L225 Difference]: With dead ends: 19 [2019-03-04 16:53:53,005 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:53:53,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:53:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2019-03-04 16:53:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:53:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-03-04 16:53:53,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 4 [2019-03-04 16:53:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:53,012 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-03-04 16:53:53,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-03-04 16:53:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:53,012 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:53,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:53,013 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-03-04 16:53:53,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:53,293 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-03-04 16:53:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:53,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:53,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:53,299 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-03-04 16:53:53,301 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:53,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:56,579 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:56,579 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-03-04 16:53:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:56,579 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:56,903 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 57.14% of their original sizes. [2019-03-04 16:53:56,903 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:57,192 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:53:57,192 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:57,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:57,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-03-04 16:53:57,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:57,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:53:57,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:53:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:57,195 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 5 states. [2019-03-04 16:53:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:58,199 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2019-03-04 16:53:58,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:58,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:53:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:58,201 INFO L225 Difference]: With dead ends: 22 [2019-03-04 16:53:58,202 INFO L226 Difference]: Without dead ends: 18 [2019-03-04 16:53:58,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-03-04 16:53:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-03-04 16:53:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:53:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-03-04 16:53:58,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 4 [2019-03-04 16:53:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:58,221 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-03-04 16:53:58,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:53:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-03-04 16:53:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:58,222 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:58,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:58,224 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash 935378, now seen corresponding path program 1 times [2019-03-04 16:53:58,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:58,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:58,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:58,653 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:53:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:58,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:58,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:58,789 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-03-04 16:53:58,790 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:58,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:07,854 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:54:07,854 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:54:07,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:07,855 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:54:08,188 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 57.14% of their original sizes. [2019-03-04 16:54:08,188 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:54:08,544 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:54:08,545 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:54:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:54:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-03-04 16:54:08,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:08,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:54:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:54:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:08,546 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 5 states. [2019-03-04 16:54:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:08,988 INFO L93 Difference]: Finished difference Result 22 states and 45 transitions. [2019-03-04 16:54:08,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:08,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:54:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:08,989 INFO L225 Difference]: With dead ends: 22 [2019-03-04 16:54:08,989 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:54:08,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:54:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-03-04 16:54:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:54:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 37 transitions. [2019-03-04 16:54:09,000 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 37 transitions. Word has length 4 [2019-03-04 16:54:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:09,000 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 37 transitions. [2019-03-04 16:54:09,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:54:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 37 transitions. [2019-03-04 16:54:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:09,000 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:09,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:09,001 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:09,001 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-03-04 16:54:09,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:09,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:09,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:09,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:09,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:09,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:09,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:09,061 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-03-04 16:54:09,063 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:09,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:14,003 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:54:14,003 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:54:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:14,003 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:54:14,344 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 53.57% of their original sizes. [2019-03-04 16:54:14,344 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:54:14,556 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-03-04 16:54:14,556 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:54:14,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:54:14,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-03-04 16:54:14,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:14,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:54:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:54:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:14,558 INFO L87 Difference]: Start difference. First operand 16 states and 37 transitions. Second operand 5 states. [2019-03-04 16:54:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:15,020 INFO L93 Difference]: Finished difference Result 24 states and 52 transitions. [2019-03-04 16:54:15,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:54:15,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-03-04 16:54:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:15,021 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:54:15,021 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:54:15,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:54:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-03-04 16:54:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:54:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-03-04 16:54:15,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 5 [2019-03-04 16:54:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:15,035 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-03-04 16:54:15,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:54:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-03-04 16:54:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:15,036 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:15,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:15,036 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-03-04 16:54:15,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:15,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:15,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:15,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:15,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:15,150 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-03-04 16:54:15,151 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:15,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:24,750 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:54:24,750 INFO L272 AbstractInterpreter]: Visited 5 different actions 32 times. Merged at 2 different actions 9 times. Widened at 2 different actions 6 times. Found 20 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:24,751 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:54:25,142 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 53.57% of their original sizes. [2019-03-04 16:54:25,142 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:54:25,387 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-03-04 16:54:25,387 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:54:25,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:54:25,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-03-04 16:54:25,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:25,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:54:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:54:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:25,388 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 5 states. [2019-03-04 16:54:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:25,653 INFO L93 Difference]: Finished difference Result 24 states and 51 transitions. [2019-03-04 16:54:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:25,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-03-04 16:54:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:25,655 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:54:25,655 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:54:25,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:54:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-03-04 16:54:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:54:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-03-04 16:54:25,668 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 5 [2019-03-04 16:54:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:25,668 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-03-04 16:54:25,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:54:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-03-04 16:54:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:25,669 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:25,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:25,669 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 28819754, now seen corresponding path program 1 times [2019-03-04 16:54:25,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:25,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:25,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:25,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:25,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:25,860 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:25,860 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-03-04 16:54:25,861 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:25,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:38,498 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:54:38,498 INFO L272 AbstractInterpreter]: Visited 5 different actions 53 times. Merged at 3 different actions 12 times. Widened at 3 different actions 8 times. Found 27 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:38,498 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:54:38,862 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 53.57% of their original sizes. [2019-03-04 16:54:38,862 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:54:39,205 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-03-04 16:54:39,205 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:54:39,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:54:39,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-03-04 16:54:39,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:39,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:54:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:54:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:39,207 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 5 states. [2019-03-04 16:54:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:39,338 INFO L93 Difference]: Finished difference Result 18 states and 42 transitions. [2019-03-04 16:54:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:39,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-03-04 16:54:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:39,339 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:54:39,339 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:54:39,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:54:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:54:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:54:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:54:39,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-03-04 16:54:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:39,340 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:54:39,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:54:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:54:39,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:54:39,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:54:39,415 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:54:39,416 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (forall ((v_idx_1098 Int) (v_idx_1096 Int) (v_idx_1094 Int)) (let ((.cse0 (+ ULTIMATE.start_main_p1 1)) (.cse1 (+ ULTIMATE.start_main_p2 1))) (and (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= .cse0 ULTIMATE.start_main_p2) (let ((.cse14 (select |#memory_int| v_idx_1098)) (.cse12 (select |#memory_int| v_idx_1094))) (let ((.cse5 (< v_idx_1094 ULTIMATE.start_main_p1)) (.cse11 (<= 0 (* 2 .cse12))) (.cse8 (<= 0 (+ .cse14 .cse12))) (.cse13 (<= .cse0 v_idx_1094)) (.cse6 (<= 0 (* 2 .cse14))) (.cse9 (<= (+ ULTIMATE.start_main_p3 1) v_idx_1098)) (.cse10 (< v_idx_1098 ULTIMATE.start_main_p3))) (let ((.cse2 (let ((.cse15 (or .cse6 .cse9 .cse10))) (or (and .cse15 .cse5) (and .cse11 (or .cse9 (and .cse6 .cse8) .cse10)) (and .cse15 .cse13))))) (or (and (<= .cse1 v_idx_1096) .cse2) (and (< v_idx_1096 ULTIMATE.start_main_p2) .cse2) (let ((.cse3 (select |#memory_int| v_idx_1096))) (and (<= (* 2 .cse3) 0) (let ((.cse7 (<= .cse3 .cse14))) (let ((.cse4 (or (and .cse6 .cse7) .cse9 .cse10))) (or (and .cse4 .cse5) (and (or (and .cse6 .cse7 .cse8) .cse9 .cse10) .cse11 (<= .cse3 .cse12)) (and .cse4 .cse13)))))))))) (<= .cse1 ULTIMATE.start_main_p3)))) [2019-03-04 16:54:39,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:54:39,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-03-04 16:54:39,416 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-03-04 16:54:39,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-03-04 16:54:39,417 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-03-04 16:54:39,417 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-03-04 16:54:39,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-03-04 16:54:39,439 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:54:39 BoogieIcfgContainer [2019-03-04 16:54:39,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:54:39,440 INFO L168 Benchmark]: Toolchain (without parser) took 82132.62 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 109.0 MB in the beginning and 638.7 MB in the end (delta: -529.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-03-04 16:54:39,447 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:54:39,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.17 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 106.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:54:39,451 INFO L168 Benchmark]: Boogie Preprocessor took 22.76 ms. Allocated memory is still 141.6 MB. Free memory was 106.8 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:54:39,454 INFO L168 Benchmark]: RCFGBuilder took 347.71 ms. Allocated memory is still 141.6 MB. Free memory was 105.5 MB in the beginning and 95.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:54:39,455 INFO L168 Benchmark]: TraceAbstraction took 81704.29 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 95.5 MB in the beginning and 638.7 MB in the end (delta: -543.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-03-04 16:54:39,463 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.17 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 106.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.76 ms. Allocated memory is still 141.6 MB. Free memory was 106.8 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.71 ms. Allocated memory is still 141.6 MB. Free memory was 105.5 MB in the beginning and 95.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81704.29 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 95.5 MB in the beginning and 638.7 MB in the end (delta: -543.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (forall v_idx_1098 : int, v_idx_1096 : int, v_idx_1094 : int :: ((p1 + 2 <= p3 && p1 + 1 <= p2) && (((p2 + 1 <= v_idx_1096 && (((((0 <= 2 * #memory_int[v_idx_1098] || p3 + 1 <= v_idx_1098) || v_idx_1098 < p3) && v_idx_1094 < p1) || (0 <= 2 * #memory_int[v_idx_1094] && ((p3 + 1 <= v_idx_1098 || (0 <= 2 * #memory_int[v_idx_1098] && 0 <= #memory_int[v_idx_1098] + #memory_int[v_idx_1094])) || v_idx_1098 < p3))) || (((0 <= 2 * #memory_int[v_idx_1098] || p3 + 1 <= v_idx_1098) || v_idx_1098 < p3) && p1 + 1 <= v_idx_1094))) || (v_idx_1096 < p2 && (((((0 <= 2 * #memory_int[v_idx_1098] || p3 + 1 <= v_idx_1098) || v_idx_1098 < p3) && v_idx_1094 < p1) || (0 <= 2 * #memory_int[v_idx_1094] && ((p3 + 1 <= v_idx_1098 || (0 <= 2 * #memory_int[v_idx_1098] && 0 <= #memory_int[v_idx_1098] + #memory_int[v_idx_1094])) || v_idx_1098 < p3))) || (((0 <= 2 * #memory_int[v_idx_1098] || p3 + 1 <= v_idx_1098) || v_idx_1098 < p3) && p1 + 1 <= v_idx_1094)))) || (2 * #memory_int[v_idx_1096] <= 0 && ((((((0 <= 2 * #memory_int[v_idx_1098] && #memory_int[v_idx_1096] <= #memory_int[v_idx_1098]) || p3 + 1 <= v_idx_1098) || v_idx_1098 < p3) && v_idx_1094 < p1) || ((((((0 <= 2 * #memory_int[v_idx_1098] && #memory_int[v_idx_1096] <= #memory_int[v_idx_1098]) && 0 <= #memory_int[v_idx_1098] + #memory_int[v_idx_1094]) || p3 + 1 <= v_idx_1098) || v_idx_1098 < p3) && 0 <= 2 * #memory_int[v_idx_1094]) && #memory_int[v_idx_1096] <= #memory_int[v_idx_1094])) || ((((0 <= 2 * #memory_int[v_idx_1098] && #memory_int[v_idx_1096] <= #memory_int[v_idx_1098]) || p3 + 1 <= v_idx_1098) || v_idx_1098 < p3) && p1 + 1 <= v_idx_1094))))) && p2 + 1 <= p3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 81.6s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 40 SDslu, 1 SDs, 0 SdLazy, 84 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 62.4s AbstIntTime, 9 AbstIntIterations, 9 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 25 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 11 NumberOfFragments, 297 HoareAnnotationTreeSize, 1 FomulaSimplifications, 20841 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...