java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:07:32,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:07:32,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:07:32,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:07:32,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:07:32,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:07:32,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:07:32,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:07:32,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:07:32,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:07:32,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:07:32,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:07:32,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:07:32,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:07:32,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:07:32,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:07:32,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:07:32,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:07:32,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:07:32,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:07:32,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:07:32,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:07:32,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:07:32,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:07:32,598 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:07:32,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:07:32,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:07:32,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:07:32,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:07:32,603 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:07:32,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:07:32,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:07:32,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:07:32,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:07:32,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:07:32,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:07:32,610 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-19 12:07:32,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:07:32,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:07:32,641 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:07:32,642 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:07:32,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:07:32,642 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:07:32,642 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:07:32,642 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:07:32,643 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-19 12:07:32,643 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:07:32,643 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-19 12:07:32,643 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-19 12:07:32,643 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:07:32,644 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:07:32,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:07:32,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:07:32,645 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:07:32,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:07:32,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:07:32,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:07:32,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:07:32,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:07:32,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:07:32,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:07:32,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:07:32,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:07:32,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:07:32,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:07:32,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:07:32,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:07:32,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:07:32,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:07:32,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:07:32,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:07:32,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:07:32,652 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:07:32,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:07:32,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:07:32,654 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:07:32,654 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:07:32,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:07:32,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:07:32,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:07:32,712 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:07:32,713 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:07:32,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl [2018-12-19 12:07:32,714 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2018-12-19 12:07:32,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:07:32,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:07:32,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:07:32,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:07:32,777 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:07:32,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:07:32,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:07:32,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:07:32,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:07:32,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... [2018-12-19 12:07:32,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:07:32,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:07:32,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:07:32,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:07:32,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:07:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 12:07:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 12:07:33,278 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 12:07:33,279 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-19 12:07:33,280 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:07:33 BoogieIcfgContainer [2018-12-19 12:07:33,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:07:33,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:07:33,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:07:33,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:07:33,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:32" (1/2) ... [2018-12-19 12:07:33,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4030bf and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:07:33, skipping insertion in model container [2018-12-19 12:07:33,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:07:33" (2/2) ... [2018-12-19 12:07:33,290 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2018-12-19 12:07:33,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:07:33,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-19 12:07:33,326 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-19 12:07:33,366 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:07:33,366 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:07:33,367 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:07:33,367 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:07:33,367 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:07:33,367 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:07:33,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:07:33,368 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:07:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-19 12:07:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-19 12:07:33,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:33,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-19 12:07:33,392 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2018-12-19 12:07:33,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:33,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:33,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:33,708 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {12#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:07:33,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {11#false} is VALID [2018-12-19 12:07:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:07:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 12:07:33,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:33,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:07:33,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:33,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:07:33,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:33,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:07:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:07:33,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:07:33,759 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-19 12:07:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:33,887 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-19 12:07:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:07:33,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:07:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 12:07:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 12:07:33,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2018-12-19 12:07:33,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:33,985 INFO L225 Difference]: With dead ends: 13 [2018-12-19 12:07:33,985 INFO L226 Difference]: Without dead ends: 8 [2018-12-19 12:07:33,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:07:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-19 12:07:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2018-12-19 12:07:34,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:34,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 6 states. [2018-12-19 12:07:34,029 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 6 states. [2018-12-19 12:07:34,029 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 6 states. [2018-12-19 12:07:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:34,032 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2018-12-19 12:07:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-19 12:07:34,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:34,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:34,033 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 8 states. [2018-12-19 12:07:34,033 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 8 states. [2018-12-19 12:07:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:34,035 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2018-12-19 12:07:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-19 12:07:34,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:34,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:34,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:34,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-19 12:07:34,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2018-12-19 12:07:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:34,041 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-19 12:07:34,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:07:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-19 12:07:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:07:34,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:34,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:07:34,042 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2018-12-19 12:07:34,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:34,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:34,316 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:07:34,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:34,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2018-12-19 12:07:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:34,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:34,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:34,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 12:07:34,344 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2018-12-19 12:07:34,385 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:34,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:34,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:34,508 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:34,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:34,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:34,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:34,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:34,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:34,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:34,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:34,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:07:34,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:34,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:34,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:34,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:34,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:34,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2018-12-19 12:07:34,686 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:34,687 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (store (store |v_#memory_int_12| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|)) [2018-12-19 12:07:34,687 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:34,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:34,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:34,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-19 12:07:34,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:34,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:34,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-19 12:07:34,935 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:34,936 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_13| ULTIMATE.start_main_p1))) (and (= 0 (select |v_#memory_int_13| ULTIMATE.start_main_p2)) (= |#memory_int| (store |v_#memory_int_13| ULTIMATE.start_main_p1 (+ .cse0 1))) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 .cse0))) [2018-12-19 12:07:34,936 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:35,045 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {61#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:35,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {65#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:35,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2018-12-19 12:07:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:35,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:35,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2018-12-19 12:07:35,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {72#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:35,165 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {72#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2018-12-19 12:07:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:35,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 12:07:35,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-19 12:07:35,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:35,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:07:35,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:35,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:07:35,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:35,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:07:35,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:07:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:35,213 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-19 12:07:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:35,314 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2018-12-19 12:07:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:07:35,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:07:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-19 12:07:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-19 12:07:35,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2018-12-19 12:07:35,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:35,350 INFO L225 Difference]: With dead ends: 10 [2018-12-19 12:07:35,350 INFO L226 Difference]: Without dead ends: 9 [2018-12-19 12:07:35,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-19 12:07:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-19 12:07:35,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:35,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 7 states. [2018-12-19 12:07:35,401 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 7 states. [2018-12-19 12:07:35,401 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 7 states. [2018-12-19 12:07:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:35,403 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:07:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:07:35,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:35,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:35,404 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 9 states. [2018-12-19 12:07:35,405 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 9 states. [2018-12-19 12:07:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:35,407 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:07:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:07:35,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:35,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:35,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:35,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:07:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-12-19 12:07:35,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2018-12-19 12:07:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:35,409 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2018-12-19 12:07:35,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:07:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2018-12-19 12:07:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:07:35,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:35,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:07:35,411 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2018-12-19 12:07:35,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:35,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:35,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:35,599 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-19 12:07:35,830 INFO L273 TraceCheckUtils]: 0: Hoare triple {117#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {119#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:07:35,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {119#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {120#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:07:35,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {120#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {118#false} is VALID [2018-12-19 12:07:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:35,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:35,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:35,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 12:07:35,864 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2018-12-19 12:07:35,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:35,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:35,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:35,911 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:35,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:35,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:35,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:35,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:35,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:36,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:07:36,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:36,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:36,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:36,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:36,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:36,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2018-12-19 12:07:36,099 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:36,099 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|]. (and (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= |#memory_int| (store (store |v_#memory_int_15| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0))) [2018-12-19 12:07:36,099 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:36,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:36,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:36,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-19 12:07:36,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:36,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:36,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-19 12:07:38,246 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:38,246 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_16| ULTIMATE.start_main_p2))) (and (= (store |v_#memory_int_16| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= 0 (select |v_#memory_int_16| ULTIMATE.start_main_p1)) (= .cse0 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:38,247 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:38,283 INFO L273 TraceCheckUtils]: 0: Hoare triple {117#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {124#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:38,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {128#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:38,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {128#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} assume !(#memory_int[main_p1] >= 0); {118#false} is VALID [2018-12-19 12:07:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:38,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:38,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {118#false} is VALID [2018-12-19 12:07:38,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {132#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:38,345 INFO L273 TraceCheckUtils]: 0: Hoare triple {117#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {136#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:38,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:38,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-19 12:07:38,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:38,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 12:07:38,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:38,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:07:38,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:07:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:07:38,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:07:38,388 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-12-19 12:07:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:38,849 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2018-12-19 12:07:38,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:07:38,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 12:07:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-19 12:07:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-19 12:07:38,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-12-19 12:07:38,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:38,904 INFO L225 Difference]: With dead ends: 17 [2018-12-19 12:07:38,904 INFO L226 Difference]: Without dead ends: 14 [2018-12-19 12:07:38,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:07:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-19 12:07:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-19 12:07:38,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:38,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 10 states. [2018-12-19 12:07:38,924 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 10 states. [2018-12-19 12:07:38,924 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 10 states. [2018-12-19 12:07:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:38,927 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-19 12:07:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2018-12-19 12:07:38,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:38,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:38,927 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 14 states. [2018-12-19 12:07:38,928 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 14 states. [2018-12-19 12:07:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:38,930 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-19 12:07:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2018-12-19 12:07:38,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:38,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:38,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:38,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:07:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-12-19 12:07:38,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2018-12-19 12:07:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:38,932 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2018-12-19 12:07:38,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:07:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2018-12-19 12:07:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:38,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:38,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:38,933 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2018-12-19 12:07:38,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:38,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:38,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:39,164 INFO L273 TraceCheckUtils]: 0: Hoare triple {208#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {210#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:07:39,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {211#(and (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:07:39,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {211#(and (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {212#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:39,168 INFO L273 TraceCheckUtils]: 3: Hoare triple {212#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {209#false} is VALID [2018-12-19 12:07:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:39,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:39,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:39,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:07:39,169 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2018-12-19 12:07:39,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:39,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:39,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:39,195 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 3. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:07:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:39,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:39,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:39,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:39,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:39,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:39,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:39,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:07:39,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:39,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:39,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:39,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:39,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:39,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2018-12-19 12:07:39,280 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:39,280 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|]. (and (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (store (store |v_#memory_int_18| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|)) [2018-12-19 12:07:39,281 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:39,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:39,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:39,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-19 12:07:39,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:39,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:39,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-19 12:07:39,418 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:39,419 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|]. (let ((.cse0 (select |v_#memory_int_19| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_19| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 (select |v_#memory_int_19| ULTIMATE.start_main_p2)) (= .cse0 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:39,419 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:39,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:39,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:39,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:39,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:39,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-19 12:07:39,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:39,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:39,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-19 12:07:41,620 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:41,620 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_20| ULTIMATE.start_main_p2))) (and (= .cse0 0) (= (store |v_#memory_int_20| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 1 (select |v_#memory_int_20| ULTIMATE.start_main_p1)))) [2018-12-19 12:07:41,621 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:41,655 INFO L273 TraceCheckUtils]: 0: Hoare triple {208#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {216#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:41,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {220#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:41,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {220#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {224#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:41,659 INFO L273 TraceCheckUtils]: 3: Hoare triple {224#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} assume !(#memory_int[main_p1] >= 0); {209#false} is VALID [2018-12-19 12:07:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:41,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:41,719 INFO L273 TraceCheckUtils]: 3: Hoare triple {228#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {209#false} is VALID [2018-12-19 12:07:41,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {232#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {228#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:41,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {236#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {232#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:41,724 INFO L273 TraceCheckUtils]: 0: Hoare triple {208#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {236#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:41,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:41,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:07:41,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:41,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:07:41,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:41,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:07:41,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:41,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:07:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:07:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:07:41,761 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2018-12-19 12:07:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:42,050 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-19 12:07:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:07:42,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:07:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-12-19 12:07:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-12-19 12:07:42,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-12-19 12:07:42,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:42,088 INFO L225 Difference]: With dead ends: 18 [2018-12-19 12:07:42,089 INFO L226 Difference]: Without dead ends: 15 [2018-12-19 12:07:42,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:07:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-19 12:07:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2018-12-19 12:07:42,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:42,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 6 states. [2018-12-19 12:07:42,109 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 6 states. [2018-12-19 12:07:42,110 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2018-12-19 12:07:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:42,112 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2018-12-19 12:07:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2018-12-19 12:07:42,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:42,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:42,113 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 15 states. [2018-12-19 12:07:42,113 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 15 states. [2018-12-19 12:07:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:42,115 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2018-12-19 12:07:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2018-12-19 12:07:42,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:42,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:42,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:42,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-19 12:07:42,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-19 12:07:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:42,118 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-19 12:07:42,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:07:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-19 12:07:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:42,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:42,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:42,119 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2018-12-19 12:07:42,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:42,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:42,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:42,183 INFO L273 TraceCheckUtils]: 0: Hoare triple {306#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {308#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:42,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {308#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {309#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:07:42,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {309#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {309#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:07:42,186 INFO L273 TraceCheckUtils]: 3: Hoare triple {309#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {307#false} is VALID [2018-12-19 12:07:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:42,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:42,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:42,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:07:42,187 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2018-12-19 12:07:42,189 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:42,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:42,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:42,206 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 3. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:42,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:42,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:42,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:42,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:42,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:42,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:42,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:07:42,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-19 12:07:42,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:42,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:42,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:42,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-19 12:07:42,279 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:42,280 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, ULTIMATE.start_main_p1]. (= (store (store |v_#memory_int_23| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|) [2018-12-19 12:07:42,280 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:07:42,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:42,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-19 12:07:42,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:42,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:42,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-19 12:07:42,330 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:42,330 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| ULTIMATE.start_main_p2))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_24| ULTIMATE.start_main_p2 (+ .cse0 (- 1)))))) [2018-12-19 12:07:42,330 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2018-12-19 12:07:42,340 INFO L273 TraceCheckUtils]: 0: Hoare triple {306#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {308#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:42,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {308#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {316#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2018-12-19 12:07:42,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {316#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume #memory_int[main_p1] >= 0; {316#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2018-12-19 12:07:42,343 INFO L273 TraceCheckUtils]: 3: Hoare triple {316#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume !(#memory_int[main_p2] <= 0); {307#false} is VALID [2018-12-19 12:07:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:42,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:42,376 INFO L273 TraceCheckUtils]: 3: Hoare triple {323#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {307#false} is VALID [2018-12-19 12:07:42,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {323#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {323#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:42,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {330#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {323#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:42,380 INFO L273 TraceCheckUtils]: 0: Hoare triple {306#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {330#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} is VALID [2018-12-19 12:07:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:42,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 12:07:42,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-19 12:07:42,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:42,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 12:07:42,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:42,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:07:42,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:42,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:07:42,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:07:42,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:42,407 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-19 12:07:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:42,502 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2018-12-19 12:07:42,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:07:42,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 12:07:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 12:07:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 12:07:42,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2018-12-19 12:07:42,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:42,529 INFO L225 Difference]: With dead ends: 12 [2018-12-19 12:07:42,529 INFO L226 Difference]: Without dead ends: 10 [2018-12-19 12:07:42,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-19 12:07:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-19 12:07:42,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:42,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 8 states. [2018-12-19 12:07:42,590 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 8 states. [2018-12-19 12:07:42,590 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 8 states. [2018-12-19 12:07:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:42,592 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-19 12:07:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2018-12-19 12:07:42,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:42,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:42,593 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states. [2018-12-19 12:07:42,593 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states. [2018-12-19 12:07:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:42,594 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-19 12:07:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2018-12-19 12:07:42,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:42,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:42,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:42,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-12-19 12:07:42,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2018-12-19 12:07:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:42,597 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2018-12-19 12:07:42,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:07:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2018-12-19 12:07:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:07:42,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:42,598 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-19 12:07:42,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2018-12-19 12:07:42,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:42,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:42,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:42,718 INFO L273 TraceCheckUtils]: 0: Hoare triple {383#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {385#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:42,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {385#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {385#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:42,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {385#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {385#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:42,723 INFO L273 TraceCheckUtils]: 3: Hoare triple {385#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {386#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:42,724 INFO L273 TraceCheckUtils]: 4: Hoare triple {386#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {384#false} is VALID [2018-12-19 12:07:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-19 12:07:42,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:07:42,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-19 12:07:42,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:42,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:07:42,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:42,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:07:42,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:42,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:07:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:07:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:07:42,753 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2018-12-19 12:07:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:42,895 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2018-12-19 12:07:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:07:42,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:07:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 12:07:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 12:07:42,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2018-12-19 12:07:42,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:42,946 INFO L225 Difference]: With dead ends: 11 [2018-12-19 12:07:42,946 INFO L226 Difference]: Without dead ends: 9 [2018-12-19 12:07:42,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:07:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-19 12:07:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-19 12:07:43,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:43,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2018-12-19 12:07:43,010 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-19 12:07:43,010 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-19 12:07:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:43,011 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:07:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:07:43,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:43,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:43,012 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-19 12:07:43,012 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-19 12:07:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:43,013 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:07:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:07:43,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:43,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:43,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:43,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:07:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-19 12:07:43,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2018-12-19 12:07:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:43,015 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2018-12-19 12:07:43,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:07:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:07:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:07:43,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:43,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:07:43,016 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2018-12-19 12:07:43,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:43,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:43,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:43,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:43,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:43,214 INFO L273 TraceCheckUtils]: 0: Hoare triple {439#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {441#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:07:43,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {442#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:07:43,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {442#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {443#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (<= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:07:43,222 INFO L273 TraceCheckUtils]: 3: Hoare triple {443#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (<= (select |#memory_int| ULTIMATE.start_main_p2) 0))} assume #memory_int[main_p1] >= 0; {444#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:43,223 INFO L273 TraceCheckUtils]: 4: Hoare triple {444#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {440#false} is VALID [2018-12-19 12:07:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:43,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:43,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:43,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:07:43,224 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2018-12-19 12:07:43,225 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:43,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:43,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:43,245 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 30 root evaluator evaluations with a maximum evaluation depth of 3. Performed 30 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:07:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:43,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:43,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:43,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:43,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:43,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:43,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:43,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:07:43,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:43,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:43,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:43,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:43,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:43,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2018-12-19 12:07:43,380 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:43,381 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|]. (and (= |#memory_int| (store (store |v_#memory_int_26| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:43,381 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:43,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:43,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:43,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-19 12:07:43,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:43,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:43,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-19 12:07:43,466 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:43,466 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p2))) (and (= 0 .cse0) (= (store |v_#memory_int_27| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_27| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:43,467 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:43,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:43,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:43,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:43,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:43,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-19 12:07:43,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:43,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:43,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-19 12:07:45,657 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:45,658 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_28| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_28| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 (+ (select |v_#memory_int_28| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:45,658 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2018-12-19 12:07:45,740 INFO L273 TraceCheckUtils]: 0: Hoare triple {439#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {448#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:45,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {448#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {452#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:45,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {452#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {456#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:07:45,761 INFO L273 TraceCheckUtils]: 3: Hoare triple {456#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {456#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:07:45,762 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {440#false} is VALID [2018-12-19 12:07:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:45,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:45,855 INFO L273 TraceCheckUtils]: 4: Hoare triple {444#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {440#false} is VALID [2018-12-19 12:07:45,857 INFO L273 TraceCheckUtils]: 3: Hoare triple {444#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {444#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:45,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {469#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {444#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:45,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {473#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {469#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:45,863 INFO L273 TraceCheckUtils]: 0: Hoare triple {439#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;assume main_p1 < main_p2;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {473#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:45,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:45,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2018-12-19 12:07:45,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:45,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-19 12:07:45,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:45,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-12-19 12:07:45,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:45,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-19 12:07:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-19 12:07:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:07:45,902 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 9 states. [2018-12-19 12:07:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:46,218 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2018-12-19 12:07:46,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:07:46,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-19 12:07:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:07:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-19 12:07:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:07:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-19 12:07:46,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2018-12-19 12:07:46,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:46,252 INFO L225 Difference]: With dead ends: 12 [2018-12-19 12:07:46,252 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 12:07:46,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:07:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 12:07:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 12:07:46,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:46,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 12:07:46,254 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:07:46,254 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:07:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:46,255 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:07:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:07:46,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:46,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:46,255 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:07:46,256 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:07:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:46,256 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:07:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:07:46,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:46,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:46,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:46,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 12:07:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 12:07:46,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2018-12-19 12:07:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:46,257 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 12:07:46,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-19 12:07:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:07:46,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:46,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 12:07:46,488 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2018-12-19 12:07:46,496 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-19 12:07:46,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-19 12:07:46,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2018-12-19 12:07:46,497 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (let ((.cse0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) (.cse1 (let ((.cse3 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1))) (.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (<= 1 .cse2) .cse3) (and .cse3 (= 0 .cse2)))))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (= 0 .cse0) .cse1))) [2018-12-19 12:07:46,497 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2018-12-19 12:07:46,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2018-12-19 12:07:46,497 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-19 12:07:46,499 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-19 12:07:46,499 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-19 12:07:46,499 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-12-19 12:07:46,502 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-12-19 12:07:46,503 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-12-19 12:07:46,503 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-19 12:07:46,503 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-19 12:07:46,514 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:07:46 BoogieIcfgContainer [2018-12-19 12:07:46,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 12:07:46,516 INFO L168 Benchmark]: Toolchain (without parser) took 13744.09 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 674.8 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -301.3 MB). Peak memory consumption was 373.4 MB. Max. memory is 7.1 GB. [2018-12-19 12:07:46,517 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:07:46,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:07:46,518 INFO L168 Benchmark]: Boogie Preprocessor took 28.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:07:46,519 INFO L168 Benchmark]: RCFGBuilder took 403.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:07:46,520 INFO L168 Benchmark]: TraceAbstraction took 13232.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 674.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -322.5 MB). Peak memory consumption was 352.3 MB. Max. memory is 7.1 GB. [2018-12-19 12:07:46,523 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 403.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13232.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 674.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -322.5 MB). Peak memory consumption was 352.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && !(p2 == p1)) || (!(p2 == p1) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (0 == #memory_int[p1 := #memory_int[p1] + 1][p2] && ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && !(p2 == p1)) || (!(p2 == p1) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 13.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 32 SDslu, 1 SDs, 0 SdLazy, 168 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 99 HoareAnnotationTreeSize, 1 FomulaSimplifications, 634 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 6 QuantifiedInterpolants, 1633 SizeOfPredicates, 5 NumberOfNonLiveVariables, 74 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...