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-a9d37a5-m [2019-02-28 10:52:03,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:52:03,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:52:03,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:52:03,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:52:03,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:52:03,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:52:03,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:52:03,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:52:03,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:52:03,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:52:03,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:52:03,651 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:52:03,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:52:03,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:52:03,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:52:03,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:52:03,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:52:03,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:52:03,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:52:03,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:52:03,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:52:03,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:52:03,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:52:03,676 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:52:03,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:52:03,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:52:03,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:52:03,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:52:03,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:52:03,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:52:03,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:52:03,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:52:03,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:52:03,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:52:03,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:52:03,683 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-02-28 10:52:03,704 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:52:03,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:52:03,706 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:52:03,706 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:52:03,706 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:52:03,706 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:52:03,706 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:52:03,707 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:52:03,707 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:52:03,707 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:52:03,707 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:52:03,707 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:52:03,708 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:52:03,708 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:52:03,709 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:52:03,709 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:52:03,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:52:03,709 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:52:03,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:52:03,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:52:03,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:52:03,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:52:03,710 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:52:03,710 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:52:03,710 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:52:03,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:52:03,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:52:03,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:52:03,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:52:03,711 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:52:03,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:52:03,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:52:03,712 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:52:03,712 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:52:03,712 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:52:03,712 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:52:03,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:52:03,713 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:52:03,713 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:52:03,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:52:03,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:52:03,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:52:03,760 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:52:03,761 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:52:03,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-02-28 10:52:03,762 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-02-28 10:52:03,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:52:03,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:52:03,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:52:03,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:52:03,801 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:52:03,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:52:03,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:52:03,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:52:03,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:52:03,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... [2019-02-28 10:52:03,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:52:03,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:52:03,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:52:03,874 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:52:03,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:52:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:52:03,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:52:04,208 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:52:04,208 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-28 10:52:04,210 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:52:04 BoogieIcfgContainer [2019-02-28 10:52:04,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:52:04,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:52:04,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:52:04,214 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:52:04,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:52:03" (1/2) ... [2019-02-28 10:52:04,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7559e6ad and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:52:04, skipping insertion in model container [2019-02-28 10:52:04,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:52:04" (2/2) ... [2019-02-28 10:52:04,218 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-02-28 10:52:04,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:52:04,236 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-28 10:52:04,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-28 10:52:04,285 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:52:04,286 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:52:04,286 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:52:04,286 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:52:04,286 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:52:04,286 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:52:04,287 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:52:04,287 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:52:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-28 10:52:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:52:04,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:04,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:52:04,311 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-28 10:52:04,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:04,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:04,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:04,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:52:04,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:52:04,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:04,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:04,525 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-28 10:52:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:04,742 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-28 10:52:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:04,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:52:04,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:04,758 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:52:04,758 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:52:04,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:52:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-28 10:52:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:52:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-28 10:52:04,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-28 10:52:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:04,800 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-28 10:52:04,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-28 10:52:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:04,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:04,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:04,801 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-28 10:52:04,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:04,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:04,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:04,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:52:04,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:52:04,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:04,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:04,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:04,849 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-28 10:52:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:04,952 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-28 10:52:04,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:04,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:04,953 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:52:04,954 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:52:04,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:52:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-28 10:52:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:52:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-28 10:52:04,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-28 10:52:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:04,959 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-28 10:52:04,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-28 10:52:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:04,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:04,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:04,960 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-28 10:52:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:04,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:05,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:05,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:05,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:05,072 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-28 10:52:05,136 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:05,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:12,764 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:12,766 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-02-28 10:52:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:12,775 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:13,074 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:13,234 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:52:13,234 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:13,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:13,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:52:13,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:13,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:13,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:13,240 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 3 states. [2019-02-28 10:52:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:14,088 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-02-28 10:52:14,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:14,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:14,089 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:52:14,089 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:52:14,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:52:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-28 10:52:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:52:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-02-28 10:52:14,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 3 [2019-02-28 10:52:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:14,094 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-02-28 10:52:14,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2019-02-28 10:52:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:14,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:14,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:14,095 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-28 10:52:14,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:14,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:14,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:14,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:14,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:14,295 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-02-28 10:52:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:14,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:14,309 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:14,309 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-28 10:52:14,312 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:14,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:17,919 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:17,920 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-02-28 10:52:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:17,920 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:18,095 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:18,224 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:52:18,225 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:18,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:18,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:52:18,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:18,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:18,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:18,226 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2019-02-28 10:52:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:18,979 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. [2019-02-28 10:52:18,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:18,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:18,980 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:52:18,980 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:52:18,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:52:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-28 10:52:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:52:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-28 10:52:18,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-02-28 10:52:18,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:18,985 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-02-28 10:52:18,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-02-28 10:52:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:18,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:18,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:18,986 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash 30178, now seen corresponding path program 1 times [2019-02-28 10:52:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:18,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:18,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:19,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:19,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:19,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:19,095 INFO L207 CegarAbsIntRunner]: [0], [12], [15] [2019-02-28 10:52:19,096 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:19,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:22,684 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:22,684 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-02-28 10:52:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:22,685 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:22,810 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:22,880 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:52:22,881 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:52:22,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:22,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:22,882 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2019-02-28 10:52:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:23,355 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2019-02-28 10:52:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:23,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:23,356 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:52:23,356 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:52:23,356 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-02-28 10:52:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:52:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:52:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:52:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-02-28 10:52:23,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 3 [2019-02-28 10:52:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:23,361 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-02-28 10:52:23,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-02-28 10:52:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:23,362 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:23,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:23,362 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-28 10:52:23,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:23,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:23,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:23,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:23,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:23,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:23,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:23,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:23,542 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-28 10:52:23,545 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:23,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:31,288 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:31,289 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-02-28 10:52:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:31,289 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:31,599 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:31,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_226 Int) (v_idx_223 Int) (v_idx_229 Int) (v_idx_233 Int) (v_idx_231 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse9 (+ c_ULTIMATE.start_main_p1 1)) (.cse10 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (let ((.cse4 (select |c_#memory_int| v_idx_229))) (let ((.cse5 (<= 0 .cse4)) (.cse6 (<= 0 (* 2 .cse4))) (.cse7 (< v_idx_229 c_ULTIMATE.start_main_p1)) (.cse8 (<= .cse9 v_idx_229))) (let ((.cse1 (or (and .cse5 .cse6) .cse7 .cse8))) (or (and .cse1 (< v_idx_231 c_ULTIMATE.start_main_p2)) (and (<= .cse2 v_idx_231) .cse1) (let ((.cse3 (select |c_#memory_int| v_idx_231))) (and (<= (* 2 .cse3) 0) (or (and (<= .cse3 .cse4) .cse5 .cse6) .cse7 .cse8) (<= .cse3 0))))))) (or (= 1 (select |c_#valid| v_idx_226)) (< v_idx_226 c_ULTIMATE.start_malloc_ptr) (<= .cse10 v_idx_226)) (or (= (select |c_#memory_int| v_idx_233) 0) (< v_idx_233 c_ULTIMATE.start_malloc_ptr) (<= .cse10 v_idx_233)) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse9 c_ULTIMATE.start_main_p2) (or (< v_idx_223 c_ULTIMATE.start_malloc_ptr) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_223)) (<= .cse10 v_idx_223)) (<= .cse2 c_ULTIMATE.start_main_p3)))) is different from false [2019-02-28 10:52:31,831 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:52:31,831 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:31,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-28 10:52:31,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:31,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:52:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:52:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:52:31,833 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 4 states. [2019-02-28 10:52:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:32,915 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2019-02-28 10:52:32,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:32,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:52:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:32,916 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:52:32,916 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:52:32,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:52:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:52:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-02-28 10:52:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:52:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-28 10:52:32,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 4 [2019-02-28 10:52:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:32,921 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-02-28 10:52:32,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:52:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-02-28 10:52:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:32,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:32,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:32,922 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:32,922 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2019-02-28 10:52:32,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:32,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:32,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:32,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:33,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:33,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:33,018 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:33,018 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [15] [2019-02-28 10:52:33,019 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:33,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:40,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:40,359 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-02-28 10:52:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:40,359 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:40,587 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:40,763 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:52:40,763 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:40,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:40,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-28 10:52:40,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:40,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:40,765 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2019-02-28 10:52:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:41,202 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2019-02-28 10:52:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:41,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:52:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:41,203 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:52:41,203 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:52:41,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:52:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-02-28 10:52:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:52:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-28 10:52:41,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 4 [2019-02-28 10:52:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:41,209 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-02-28 10:52:41,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-02-28 10:52:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:41,210 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:41,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:41,210 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-28 10:52:41,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:41,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:41,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:41,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:41,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:41,581 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2019-02-28 10:52:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:41,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:41,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:41,612 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:41,612 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-28 10:52:41,613 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:41,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:49,372 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:49,372 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-02-28 10:52:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:49,373 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:49,552 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:49,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_369 Int) (v_idx_366 Int) (v_idx_372 Int) (v_idx_376 Int) (v_idx_374 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_366)) (<= .cse1 v_idx_366) (< v_idx_366 c_ULTIMATE.start_malloc_ptr)) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (or (= 1 (select |c_#valid| v_idx_369)) (< v_idx_369 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_369)) (or (< v_idx_372 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_372)) (<= .cse3 v_idx_372)) (<= .cse3 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p3) (let ((.cse7 (select |c_#memory_int| v_idx_376))) (let ((.cse8 (<= 0 .cse7)) (.cse9 (<= 0 (* 2 .cse7))) (.cse4 (<= .cse1 v_idx_376)) (.cse5 (< v_idx_376 c_ULTIMATE.start_malloc_ptr))) (let ((.cse10 (or (and .cse8 .cse9) .cse4 .cse5))) (or (let ((.cse6 (select |c_#memory_int| v_idx_374))) (and (or .cse4 .cse5 (and (<= .cse6 .cse7) .cse8 .cse9)) (<= (* 2 .cse6) 0) (<= .cse6 0))) (and (< v_idx_374 c_ULTIMATE.start_main_p2) .cse10) (and .cse10 (<= .cse2 v_idx_374))))))))) is different from false [2019-02-28 10:52:49,670 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:52:49,670 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:49,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:49,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-28 10:52:49,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:49,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:52:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:52:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:52:49,671 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 4 states. [2019-02-28 10:52:49,773 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_369 Int) (v_idx_366 Int) (v_idx_372 Int) (v_idx_376 Int) (v_idx_374 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_366)) (<= .cse1 v_idx_366) (< v_idx_366 c_ULTIMATE.start_malloc_ptr)) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (or (= 1 (select |c_#valid| v_idx_369)) (< v_idx_369 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_369)) (or (< v_idx_372 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_372)) (<= .cse3 v_idx_372)) (<= .cse3 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p3) (let ((.cse7 (select |c_#memory_int| v_idx_376))) (let ((.cse8 (<= 0 .cse7)) (.cse9 (<= 0 (* 2 .cse7))) (.cse4 (<= .cse1 v_idx_376)) (.cse5 (< v_idx_376 c_ULTIMATE.start_malloc_ptr))) (let ((.cse10 (or (and .cse8 .cse9) .cse4 .cse5))) (or (let ((.cse6 (select |c_#memory_int| v_idx_374))) (and (or .cse4 .cse5 (and (<= .cse6 .cse7) .cse8 .cse9)) (<= (* 2 .cse6) 0) (<= .cse6 0))) (and (< v_idx_374 c_ULTIMATE.start_main_p2) .cse10) (and .cse10 (<= .cse2 v_idx_374))))))))) (forall ((v_idx_356 Int) (v_idx_359 Int) (v_idx_361 Int) (v_idx_353 Int) (v_idx_363 Int)) (let ((.cse20 (+ c_ULTIMATE.start_main_p1 2)) (.cse21 (+ c_ULTIMATE.start_main_p1 1)) (.cse19 (+ c_ULTIMATE.start_main_p3 1)) (.cse12 (+ c_ULTIMATE.start_main_p2 1))) (and (let ((.cse17 (select |c_#memory_int| v_idx_363))) (let ((.cse15 (<= 0 (* 2 .cse17))) (.cse16 (<= 0 .cse17)) (.cse14 (< v_idx_363 c_ULTIMATE.start_malloc_ptr)) (.cse18 (<= .cse19 v_idx_363))) (let ((.cse11 (or (and .cse15 .cse16) .cse14 .cse18))) (or (and .cse11 (<= .cse12 v_idx_361)) (let ((.cse13 (select |c_#memory_int| v_idx_361))) (and (<= .cse13 0) (<= (* 2 .cse13) 0) (or .cse14 (and .cse15 .cse16 (<= .cse13 .cse17)) .cse18))) (and (< v_idx_361 c_ULTIMATE.start_main_p2) .cse11))))) (<= .cse20 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (<= .cse19 v_idx_353) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_353) 0) (< v_idx_353 c_ULTIMATE.start_malloc_ptr)) (or (< v_idx_359 c_ULTIMATE.start_main_p1) (<= .cse21 v_idx_359) (= 0 (select |c_#memory_int| v_idx_359))) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p2) (or (< v_idx_356 c_ULTIMATE.start_malloc_ptr) (= 1 (select |c_#valid| v_idx_356)) (<= .cse19 v_idx_356)) (<= .cse12 c_ULTIMATE.start_main_p3))))) is different from false [2019-02-28 10:52:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:50,971 INFO L93 Difference]: Finished difference Result 19 states and 35 transitions. [2019-02-28 10:52:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:50,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:52:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:50,972 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:52:50,972 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:52:50,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:52:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:52:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-28 10:52:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:52:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2019-02-28 10:52:50,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 4 [2019-02-28 10:52:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:50,983 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. [2019-02-28 10:52:50,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:52:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2019-02-28 10:52:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:50,984 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:50,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:50,984 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash 28817894, now seen corresponding path program 1 times [2019-02-28 10:52:50,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:50,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:51,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:51,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:51,132 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:52:51,132 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-28 10:52:51,133 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:51,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:05,345 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:53:05,345 INFO L272 AbstractInterpreter]: Visited 5 different actions 57 times. Merged at 3 different actions 13 times. Widened at 3 different actions 9 times. Found 29 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:53:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:05,346 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:53:05,663 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:53:05,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_454 Int) (v_idx_444 Int) (v_idx_447 Int) (v_idx_452 Int) (v_idx_450 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 2)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse19 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1))) (and (or (< v_idx_447 c_ULTIMATE.start_malloc_ptr) (= (select |c_#valid| v_idx_447) 1) (<= .cse0 v_idx_447)) (<= .cse1 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_444)) (< v_idx_444 c_ULTIMATE.start_malloc_ptr) (<= .cse0 v_idx_444)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (let ((.cse11 (select |c_#memory_int| v_idx_452)) (.cse16 (select |c_#memory_int| v_idx_450))) (let ((.cse15 (<= .cse2 v_idx_452)) (.cse14 (< v_idx_452 c_ULTIMATE.start_main_p2)) (.cse5 (<= .cse11 .cse16)) (.cse10 (<= (* 2 .cse11) 0)) (.cse12 (<= .cse11 0)) (.cse4 (< v_idx_450 c_ULTIMATE.start_main_p1)) (.cse9 (<= .cse19 v_idx_450)) (.cse6 (<= 0 .cse16)) (.cse8 (<= 0 (* 2 .cse16)))) (let ((.cse17 (let ((.cse18 (or .cse4 .cse9 (and .cse6 .cse8)))) (or (and .cse18 .cse15) (and .cse18 .cse14) (and (or .cse4 (and .cse5 .cse6 .cse8) .cse9) .cse10 .cse12))))) (or (let ((.cse3 (select |c_#memory_int| v_idx_454))) (and (<= 0 (* 2 .cse3)) (let ((.cse7 (<= 0 (+ .cse3 .cse16)))) (let ((.cse13 (or .cse4 .cse9 (and .cse6 .cse7 .cse8)))) (or (and (or .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9) .cse10 (<= .cse11 .cse3) .cse12) (and .cse13 .cse14) (and .cse13 .cse15)))) (<= 0 .cse3))) (and (< v_idx_454 c_ULTIMATE.start_malloc_ptr) .cse17) (and (<= .cse0 v_idx_454) .cse17))))) (<= .cse19 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p3)))) is different from false [2019-02-28 10:53:05,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_478 Int) (v_idx_476 Int) (v_idx_470 Int) (v_idx_480 Int) (v_idx_473 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse18 (+ c_ULTIMATE.start_main_p3 1)) (.cse19 (+ c_ULTIMATE.start_main_p1 1)) (.cse16 (+ c_ULTIMATE.start_main_p2 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (let ((.cse15 (select |c_#memory_int| v_idx_480)) (.cse4 (select |c_#memory_int| v_idx_476))) (let ((.cse3 (<= 0 (* 2 .cse4))) (.cse5 (<= 0 .cse4)) (.cse10 (<= 0 (+ .cse15 .cse4))) (.cse14 (<= .cse19 v_idx_476)) (.cse13 (< v_idx_476 c_ULTIMATE.start_main_p1)) (.cse6 (<= .cse18 v_idx_480)) (.cse11 (< v_idx_480 c_ULTIMATE.start_malloc_ptr)) (.cse8 (<= 0 .cse15)) (.cse9 (<= 0 (* 2 .cse15)))) (let ((.cse1 (let ((.cse17 (or .cse6 .cse11 (and .cse8 .cse9)))) (or (and .cse3 .cse5 (or .cse6 .cse11 (and .cse8 .cse9 .cse10))) (and .cse17 .cse14) (and .cse13 .cse17))))) (or (and .cse1 (< v_idx_478 c_ULTIMATE.start_main_p2)) (let ((.cse2 (select |c_#memory_int| v_idx_478))) (and (<= (* 2 .cse2) 0) (let ((.cse7 (<= .cse2 .cse15))) (let ((.cse12 (or .cse6 (and .cse7 .cse8 .cse9) .cse11))) (or (and .cse3 (<= .cse2 .cse4) .cse5 (or .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11)) (and .cse12 .cse13) (and .cse12 .cse14)))) (<= .cse2 0))) (and .cse1 (<= .cse16 v_idx_478)))))) (or (<= .cse18 v_idx_470) (< v_idx_470 c_ULTIMATE.start_malloc_ptr) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_470) 0)) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (or (<= .cse18 v_idx_473) (< v_idx_473 c_ULTIMATE.start_malloc_ptr) (= 1 (select |c_#valid| v_idx_473))) (<= .cse19 c_ULTIMATE.start_main_p2) (<= .cse16 c_ULTIMATE.start_main_p3)))) is different from false [2019-02-28 10:53:05,949 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-28 10:53:05,949 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:53:05,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:53:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-02-28 10:53:05,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:53:05,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:53:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:53:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:53:05,950 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 5 states. [2019-02-28 10:53:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:06,776 INFO L93 Difference]: Finished difference Result 14 states and 30 transitions. [2019-02-28 10:53:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:53:06,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:53:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:06,777 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:53:06,777 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:53:06,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:53:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:53:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:53:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:53:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:53:06,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-28 10:53:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:06,778 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:53:06,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:53:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:53:06,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:53:06,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:53:06,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:53:06,854 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (forall ((v_idx_467 Int) (v_idx_457 Int) (v_idx_465 Int) (v_idx_460 Int) (v_idx_463 Int)) (let ((.cse0 (+ ULTIMATE.start_main_p1 2)) (.cse18 (+ ULTIMATE.start_main_p1 1)) (.cse19 (+ ULTIMATE.start_main_p3 1)) (.cse15 (+ ULTIMATE.start_main_p2 1))) (and (<= .cse0 ULTIMATE.start_main_p3) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p3) (<= ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (let ((.cse14 (select |#memory_int| v_idx_463)) (.cse11 (select |#memory_int| v_idx_467))) (let ((.cse1 (<= .cse19 v_idx_467)) (.cse9 (<= 0 (* 2 .cse11))) (.cse8 (<= 0 (+ .cse14 .cse11))) (.cse12 (<= 0 .cse11)) (.cse13 (< v_idx_467 ULTIMATE.start_malloc_ptr)) (.cse3 (<= .cse18 v_idx_463)) (.cse5 (<= 0 (* 2 .cse14))) (.cse7 (<= 0 .cse14)) (.cse4 (< v_idx_463 ULTIMATE.start_main_p1))) (let ((.cse16 (let ((.cse17 (or .cse3 (and .cse5 .cse7) .cse4))) (or (and .cse1 .cse17) (and .cse9 (or (and .cse5 .cse7 .cse8) .cse3 .cse4) .cse12) (and .cse13 .cse17))))) (or (let ((.cse10 (select |#memory_int| v_idx_465))) (and (let ((.cse6 (<= .cse10 .cse14))) (let ((.cse2 (or .cse3 .cse4 (and .cse5 .cse6 .cse7)))) (or (and .cse1 .cse2) (and (or .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8)) .cse9 (<= .cse10 .cse11) .cse12) (and .cse13 .cse2)))) (<= (* 2 .cse10) 0) (<= .cse10 0))) (and (<= .cse15 v_idx_465) .cse16) (and .cse16 (< v_idx_465 ULTIMATE.start_main_p2)))))) (or (= (select |#valid| v_idx_460) 1) (<= .cse19 v_idx_460) (< v_idx_460 ULTIMATE.start_malloc_ptr)) (<= .cse0 ULTIMATE.start_malloc_ptr) (<= .cse15 ULTIMATE.start_malloc_ptr) (<= .cse18 ULTIMATE.start_main_p2) (or (< v_idx_457 ULTIMATE.start_malloc_ptr) (= (select |ULTIMATE.start_malloc_old_#valid| v_idx_457) 0) (<= .cse19 v_idx_457)) (<= .cse15 ULTIMATE.start_main_p3)))) [2019-02-28 10:53:06,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:53:06,854 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-02-28 10:53:06,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-28 10:53:06,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-02-28 10:53:06,854 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-28 10:53:06,854 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-02-28 10:53:06,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-28 10:53:06,869 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:53:06 BoogieIcfgContainer [2019-02-28 10:53:06,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:53:06,870 INFO L168 Benchmark]: Toolchain (without parser) took 63071.12 ms. Allocated memory was 137.4 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 104.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 534.4 MB. Max. memory is 7.1 GB. [2019-02-28 10:53:06,872 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:53:06,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.55 ms. Allocated memory is still 137.4 MB. Free memory was 104.9 MB in the beginning and 102.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:53:06,873 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 ms. Allocated memory is still 137.4 MB. Free memory was 102.7 MB in the beginning and 101.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:53:06,874 INFO L168 Benchmark]: RCFGBuilder took 336.37 ms. Allocated memory is still 137.4 MB. Free memory was 101.4 MB in the beginning and 91.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-02-28 10:53:06,875 INFO L168 Benchmark]: TraceAbstraction took 62658.86 ms. Allocated memory was 137.4 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 91.3 MB in the beginning and 2.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 520.8 MB. Max. memory is 7.1 GB. [2019-02-28 10:53:06,879 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.55 ms. Allocated memory is still 137.4 MB. Free memory was 104.9 MB in the beginning and 102.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.38 ms. Allocated memory is still 137.4 MB. Free memory was 102.7 MB in the beginning and 101.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 336.37 ms. Allocated memory is still 137.4 MB. Free memory was 101.4 MB in the beginning and 91.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62658.86 ms. Allocated memory was 137.4 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 91.3 MB in the beginning and 2.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 520.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (forall v_idx_467 : int, v_idx_457 : int, v_idx_465 : int, v_idx_460 : int, v_idx_463 : int :: ((((((((p1 + 2 <= p3 && ptr <= p3) && p3 <= ptr) && (((((((p3 + 1 <= v_idx_467 && ((p1 + 1 <= v_idx_463 || v_idx_463 < p1) || ((0 <= 2 * #memory_int[v_idx_463] && #memory_int[v_idx_465] <= #memory_int[v_idx_463]) && 0 <= #memory_int[v_idx_463]))) || (((((p1 + 1 <= v_idx_463 || v_idx_463 < p1) || (((0 <= 2 * #memory_int[v_idx_463] && #memory_int[v_idx_465] <= #memory_int[v_idx_463]) && 0 <= #memory_int[v_idx_463]) && 0 <= #memory_int[v_idx_463] + #memory_int[v_idx_467])) && 0 <= 2 * #memory_int[v_idx_467]) && #memory_int[v_idx_465] <= #memory_int[v_idx_467]) && 0 <= #memory_int[v_idx_467])) || (v_idx_467 < ptr && ((p1 + 1 <= v_idx_463 || v_idx_463 < p1) || ((0 <= 2 * #memory_int[v_idx_463] && #memory_int[v_idx_465] <= #memory_int[v_idx_463]) && 0 <= #memory_int[v_idx_463])))) && 2 * #memory_int[v_idx_465] <= 0) && #memory_int[v_idx_465] <= 0) || (p2 + 1 <= v_idx_465 && (((p3 + 1 <= v_idx_467 && ((p1 + 1 <= v_idx_463 || (0 <= 2 * #memory_int[v_idx_463] && 0 <= #memory_int[v_idx_463])) || v_idx_463 < p1)) || ((0 <= 2 * #memory_int[v_idx_467] && ((((0 <= 2 * #memory_int[v_idx_463] && 0 <= #memory_int[v_idx_463]) && 0 <= #memory_int[v_idx_463] + #memory_int[v_idx_467]) || p1 + 1 <= v_idx_463) || v_idx_463 < p1)) && 0 <= #memory_int[v_idx_467])) || (v_idx_467 < ptr && ((p1 + 1 <= v_idx_463 || (0 <= 2 * #memory_int[v_idx_463] && 0 <= #memory_int[v_idx_463])) || v_idx_463 < p1))))) || ((((p3 + 1 <= v_idx_467 && ((p1 + 1 <= v_idx_463 || (0 <= 2 * #memory_int[v_idx_463] && 0 <= #memory_int[v_idx_463])) || v_idx_463 < p1)) || ((0 <= 2 * #memory_int[v_idx_467] && ((((0 <= 2 * #memory_int[v_idx_463] && 0 <= #memory_int[v_idx_463]) && 0 <= #memory_int[v_idx_463] + #memory_int[v_idx_467]) || p1 + 1 <= v_idx_463) || v_idx_463 < p1)) && 0 <= #memory_int[v_idx_467])) || (v_idx_467 < ptr && ((p1 + 1 <= v_idx_463 || (0 <= 2 * #memory_int[v_idx_463] && 0 <= #memory_int[v_idx_463])) || v_idx_463 < p1))) && v_idx_465 < p2))) && ((#valid[v_idx_460] == 1 || p3 + 1 <= v_idx_460) || v_idx_460 < ptr)) && p1 + 2 <= ptr) && p2 + 1 <= ptr) && p1 + 1 <= p2) && ((v_idx_457 < ptr || old(malloc_old_#valid)[v_idx_457] == 0) || p3 + 1 <= v_idx_457)) && p2 + 1 <= p3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 62.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 20 SDslu, 1 SDs, 0 SdLazy, 50 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 51.9s AbstIntTime, 7 AbstIntIterations, 7 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 410 HoareAnnotationTreeSize, 1 FomulaSimplifications, 10590 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...