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-0302a3f [2019-02-27 12:58:08,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 12:58:08,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 12:58:08,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 12:58:08,664 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 12:58:08,665 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 12:58:08,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 12:58:08,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 12:58:08,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 12:58:08,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 12:58:08,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 12:58:08,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 12:58:08,673 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 12:58:08,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 12:58:08,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 12:58:08,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 12:58:08,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 12:58:08,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 12:58:08,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 12:58:08,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 12:58:08,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 12:58:08,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 12:58:08,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 12:58:08,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 12:58:08,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 12:58:08,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 12:58:08,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 12:58:08,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 12:58:08,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 12:58:08,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 12:58:08,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 12:58:08,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 12:58:08,693 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 12:58:08,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 12:58:08,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 12:58:08,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 12:58:08,695 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 [2019-02-27 12:58:08,708 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 12:58:08,708 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 12:58:08,709 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 12:58:08,709 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 12:58:08,709 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 12:58:08,709 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 12:58:08,710 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 12:58:08,710 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 12:58:08,710 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 12:58:08,710 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 12:58:08,710 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 12:58:08,711 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 12:58:08,711 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 12:58:08,711 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 12:58:08,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 12:58:08,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 12:58:08,712 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 12:58:08,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 12:58:08,712 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 12:58:08,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 12:58:08,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 12:58:08,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 12:58:08,713 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 12:58:08,713 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 12:58:08,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 12:58:08,714 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 12:58:08,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 12:58:08,714 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 12:58:08,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 12:58:08,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 12:58:08,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 12:58:08,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:58:08,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 12:58:08,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 12:58:08,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 12:58:08,716 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 12:58:08,716 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 12:58:08,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 12:58:08,716 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 12:58:08,717 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 12:58:08,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 12:58:08,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 12:58:08,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 12:58:08,781 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 12:58:08,781 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 12:58:08,782 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 [2019-02-27 12:58:08,782 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-02-27 12:58:08,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 12:58:08,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 12:58:08,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 12:58:08,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 12:58:08,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 12:58:08,847 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,859 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 12:58:08,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 12:58:08,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 12:58:08,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 12:58:08,898 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,898 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,899 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,900 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,902 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,906 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,908 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 27.02 12:58:08" (1/1) ... [2019-02-27 12:58:08,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 12:58:08,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 12:58:08,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 12:58:08,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 12:58:08,911 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 27.02 12:58:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:58:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-27 12:58:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-27 12:58:09,311 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-27 12:58:09,311 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-27 12:58:09,312 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:58:09 BoogieIcfgContainer [2019-02-27 12:58:09,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 12:58:09,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 12:58:09,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 12:58:09,317 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 12:58:09,317 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 27.02 12:58:08" (1/2) ... [2019-02-27 12:58:09,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701c18c1 and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 12:58:09, skipping insertion in model container [2019-02-27 12:58:09,319 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 27.02 12:58:09" (2/2) ... [2019-02-27 12:58:09,320 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-02-27 12:58:09,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 12:58:09,338 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-27 12:58:09,360 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-27 12:58:09,399 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 12:58:09,399 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 12:58:09,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 12:58:09,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 12:58:09,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 12:58:09,401 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 12:58:09,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 12:58:09,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 12:58:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-27 12:58:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-27 12:58:09,428 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:58:09,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-27 12:58:09,432 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:58:09,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:09,439 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-27 12:58:09,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:58:09,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:09,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:09,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:09,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:58:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:09,736 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 [2019-02-27 12:58:09,743 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 [2019-02-27 12:58:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:09,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:58:09,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-27 12:58:09,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:58:09,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:58:09,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:58:09,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:58:09,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:09,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:58:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:58:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:58:09,802 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-27 12:58:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:10,007 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-27 12:58:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:58:10,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:58:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:58:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:58:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-27 12:58:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:58:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-27 12:58:10,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2019-02-27 12:58:10,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:10,087 INFO L225 Difference]: With dead ends: 13 [2019-02-27 12:58:10,088 INFO L226 Difference]: Without dead ends: 8 [2019-02-27 12:58:10,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:58:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-27 12:58:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-27 12:58:10,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:58:10,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 6 states. [2019-02-27 12:58:10,129 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 6 states. [2019-02-27 12:58:10,129 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 6 states. [2019-02-27 12:58:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:10,131 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-02-27 12:58:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-27 12:58:10,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:10,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:10,133 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 8 states. [2019-02-27 12:58:10,133 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 8 states. [2019-02-27 12:58:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:10,149 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-02-27 12:58:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-27 12:58:10,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:10,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:10,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:58:10,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:58:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:58:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-27 12:58:10,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-27 12:58:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:58:10,158 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-27 12:58:10,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:58:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-27 12:58:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:58:10,158 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:58:10,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:58:10,159 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:58:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-27 12:58:10,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:58:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:10,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:58:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:10,329 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 [2019-02-27 12:58:10,336 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 [2019-02-27 12:58:10,354 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 [2019-02-27 12:58:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:10,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:10,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:58:10,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-27 12:58:10,360 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-27 12:58:10,396 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:58:10,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:58:10,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:58:10,511 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. [2019-02-27 12:58:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:10,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:58:10,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:10,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:58:10,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:10,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:58:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:10,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-27 12:58:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:10,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:58:10,794 INFO L467 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 [2019-02-27 12:58:10,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:10,862 INFO L467 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 [2019-02-27 12:58:10,890 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:10,965 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:10,987 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:58:10,988 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-02-27 12:58:10,991 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:10,992 WARN L398 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|)) [2019-02-27 12:58:10,992 WARN L399 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)) [2019-02-27 12:58:11,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:11,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:11,146 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-27 12:58:11,168 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:11,287 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:58:11,288 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-27 12:58:11,305 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:11,306 WARN L398 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))) [2019-02-27 12:58:11,306 WARN L399 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)) [2019-02-27 12:58:11,390 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 [2019-02-27 12:58:11,392 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 [2019-02-27 12:58:11,405 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 [2019-02-27 12:58:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:11,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:58:11,494 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 [2019-02-27 12:58:11,495 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 [2019-02-27 12:58:11,497 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 [2019-02-27 12:58:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:11,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-27 12:58:11,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-27 12:58:11,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:58:11,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:58:11,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:58:11,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:58:11,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:11,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:58:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:58:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:58:11,526 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-27 12:58:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:11,668 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-02-27 12:58:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:58:11,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:58:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:58:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:58:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-02-27 12:58:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:58:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-02-27 12:58:11,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2019-02-27 12:58:11,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:11,704 INFO L225 Difference]: With dead ends: 10 [2019-02-27 12:58:11,704 INFO L226 Difference]: Without dead ends: 9 [2019-02-27 12:58:11,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:58:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-27 12:58:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-02-27 12:58:11,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:58:11,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 7 states. [2019-02-27 12:58:11,720 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 7 states. [2019-02-27 12:58:11,720 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 7 states. [2019-02-27 12:58:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:11,722 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-27 12:58:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-27 12:58:11,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:11,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:11,723 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 9 states. [2019-02-27 12:58:11,723 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 9 states. [2019-02-27 12:58:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:11,725 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-27 12:58:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-27 12:58:11,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:11,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:11,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:58:11,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:58:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-27 12:58:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-02-27 12:58:11,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-02-27 12:58:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:58:11,727 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-02-27 12:58:11,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:58:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-02-27 12:58:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:58:11,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:58:11,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:58:11,728 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:58:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-27 12:58:11,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:58:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:11,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:11,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:58:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:12,134 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 [2019-02-27 12:58:12,148 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 [2019-02-27 12:58:12,158 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 [2019-02-27 12:58:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:12,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:12,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:58:12,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-27 12:58:12,159 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-27 12:58:12,164 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:58:12,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:58:12,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:58:12,180 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. [2019-02-27 12:58:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:12,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:58:12,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:12,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:58:12,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:12,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:58:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:12,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-27 12:58:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:12,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:58:12,223 INFO L467 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 [2019-02-27 12:58:12,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:12,238 INFO L467 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 [2019-02-27 12:58:12,242 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:12,254 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:12,288 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:12,289 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-02-27 12:58:12,293 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:12,293 WARN L398 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))) [2019-02-27 12:58:12,293 WARN L399 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)) [2019-02-27 12:58:12,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:12,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:12,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-27 12:58:12,401 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:12,427 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:58:12,427 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-27 12:58:14,467 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:14,468 WARN L398 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))) [2019-02-27 12:58:14,468 WARN L399 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)) [2019-02-27 12:58:14,500 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 [2019-02-27 12:58:14,502 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 [2019-02-27 12:58:14,504 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 [2019-02-27 12:58:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:14,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:58:14,532 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 [2019-02-27 12:58:14,533 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 [2019-02-27 12:58:14,535 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 [2019-02-27 12:58:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:14,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:58:14,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-27 12:58:14,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:58:14,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 12:58:14,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:58:14,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 12:58:14,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:14,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 12:58:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 12:58:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-27 12:58:14,572 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-02-27 12:58:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:14,877 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-27 12:58:14,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-27 12:58:14,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 12:58:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:58:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:58:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-02-27 12:58:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:58:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-02-27 12:58:14,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2019-02-27 12:58:14,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:14,968 INFO L225 Difference]: With dead ends: 17 [2019-02-27 12:58:14,969 INFO L226 Difference]: Without dead ends: 14 [2019-02-27 12:58:14,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-27 12:58:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-27 12:58:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-02-27 12:58:15,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:58:15,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 10 states. [2019-02-27 12:58:15,001 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 10 states. [2019-02-27 12:58:15,001 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 10 states. [2019-02-27 12:58:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:15,003 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2019-02-27 12:58:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2019-02-27 12:58:15,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:15,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:15,004 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 14 states. [2019-02-27 12:58:15,004 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 14 states. [2019-02-27 12:58:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:15,006 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2019-02-27 12:58:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2019-02-27 12:58:15,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:15,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:15,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:58:15,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:58:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-27 12:58:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-02-27 12:58:15,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-02-27 12:58:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:58:15,009 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-02-27 12:58:15,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-27 12:58:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-02-27 12:58:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:58:15,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:58:15,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:58:15,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:58:15,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-27 12:58:15,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:58:15,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:15,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:15,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:15,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:58:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:15,209 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 [2019-02-27 12:58:15,211 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 [2019-02-27 12:58:15,211 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 [2019-02-27 12:58:15,214 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 [2019-02-27 12:58:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:15,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:15,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:58:15,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-27 12:58:15,217 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-27 12:58:15,219 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:58:15,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:58:15,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:58:15,235 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. [2019-02-27 12:58:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:15,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:58:15,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:15,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:58:15,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:15,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:58:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:15,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-27 12:58:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:15,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:58:15,273 INFO L467 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 [2019-02-27 12:58:15,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:15,295 INFO L467 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 [2019-02-27 12:58:15,300 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:15,310 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:15,318 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:15,318 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-02-27 12:58:15,323 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:15,323 WARN L398 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|)) [2019-02-27 12:58:15,323 WARN L399 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)) [2019-02-27 12:58:15,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:15,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:15,407 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-27 12:58:15,412 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:15,422 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:15,423 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-27 12:58:15,432 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:15,433 WARN L398 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))) [2019-02-27 12:58:15,433 WARN L399 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)) [2019-02-27 12:58:15,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:15,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:15,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:15,504 INFO L467 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 15 [2019-02-27 12:58:15,507 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:15,517 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:58:15,518 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-27 12:58:17,549 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:17,549 WARN L398 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)))) [2019-02-27 12:58:17,549 WARN L399 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)) [2019-02-27 12:58:17,606 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 [2019-02-27 12:58:17,608 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 [2019-02-27 12:58:17,609 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 [2019-02-27 12:58:17,611 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 [2019-02-27 12:58:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:17,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:58:17,721 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 [2019-02-27 12:58:17,723 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 [2019-02-27 12:58:17,725 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 [2019-02-27 12:58:17,726 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 [2019-02-27 12:58:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:17,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:58:17,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-27 12:58:17,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:58:17,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-27 12:58:17,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:58:17,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-27 12:58:17,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:17,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-27 12:58:17,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-27 12:58:17,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-27 12:58:17,769 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-02-27 12:58:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:18,071 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-02-27 12:58:18,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-27 12:58:18,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-27 12:58:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:58:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 12:58:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-02-27 12:58:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 12:58:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-02-27 12:58:18,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2019-02-27 12:58:18,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:18,115 INFO L225 Difference]: With dead ends: 18 [2019-02-27 12:58:18,115 INFO L226 Difference]: Without dead ends: 15 [2019-02-27 12:58:18,116 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 [2019-02-27 12:58:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-27 12:58:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-02-27 12:58:18,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:58:18,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 6 states. [2019-02-27 12:58:18,141 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 6 states. [2019-02-27 12:58:18,141 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2019-02-27 12:58:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:18,144 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2019-02-27 12:58:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2019-02-27 12:58:18,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:18,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:18,145 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 15 states. [2019-02-27 12:58:18,145 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 15 states. [2019-02-27 12:58:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:18,147 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2019-02-27 12:58:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2019-02-27 12:58:18,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:18,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:18,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:58:18,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:58:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:58:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-27 12:58:18,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-02-27 12:58:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:58:18,149 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-27 12:58:18,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-27 12:58:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-27 12:58:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:58:18,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:58:18,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:58:18,150 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:58:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-02-27 12:58:18,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:58:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:18,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:18,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:58:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:18,223 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 [2019-02-27 12:58:18,224 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 [2019-02-27 12:58:18,224 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 [2019-02-27 12:58:18,225 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 [2019-02-27 12:58:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:18,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:18,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:58:18,226 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-27 12:58:18,226 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-02-27 12:58:18,228 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:58:18,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:58:18,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:58:18,265 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. [2019-02-27 12:58:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:18,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:58:18,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:18,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:58:18,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:18,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:58:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:18,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-27 12:58:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:18,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:58:18,328 INFO L467 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 [2019-02-27 12:58:18,336 INFO L467 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 [2019-02-27 12:58:18,341 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:18,353 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:18,358 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:58:18,358 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-27 12:58:18,364 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:18,364 WARN L398 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|) [2019-02-27 12:58:18,364 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-27 12:58:18,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:18,423 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-27 12:58:18,424 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:18,427 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:18,428 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-27 12:58:18,435 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:18,435 WARN L398 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)))))) [2019-02-27 12:58:18,436 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2019-02-27 12:58:18,445 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 [2019-02-27 12:58:18,446 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 [2019-02-27 12:58:18,447 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 [2019-02-27 12:58:18,447 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 [2019-02-27 12:58:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:18,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:58:18,469 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 [2019-02-27 12:58:18,470 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 [2019-02-27 12:58:18,471 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 [2019-02-27 12:58:18,478 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 [2019-02-27 12:58:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:18,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-27 12:58:18,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-27 12:58:18,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:58:18,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:58:18,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:58:18,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:58:18,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:18,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:58:18,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:58:18,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:58:18,504 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-27 12:58:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:18,581 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-02-27 12:58:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:58:18,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:58:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:58:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:58:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-27 12:58:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:58:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-27 12:58:18,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-27 12:58:18,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:18,600 INFO L225 Difference]: With dead ends: 12 [2019-02-27 12:58:18,600 INFO L226 Difference]: Without dead ends: 10 [2019-02-27 12:58:18,601 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 [2019-02-27 12:58:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-27 12:58:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-02-27 12:58:18,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:58:18,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 8 states. [2019-02-27 12:58:18,649 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 8 states. [2019-02-27 12:58:18,649 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 8 states. [2019-02-27 12:58:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:18,651 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2019-02-27 12:58:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2019-02-27 12:58:18,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:18,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:18,651 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states. [2019-02-27 12:58:18,651 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states. [2019-02-27 12:58:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:18,653 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2019-02-27 12:58:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2019-02-27 12:58:18,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:18,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:18,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:58:18,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:58:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 12:58:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-02-27 12:58:18,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-02-27 12:58:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:58:18,655 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-02-27 12:58:18,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:58:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-02-27 12:58:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-27 12:58:18,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:58:18,655 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-27 12:58:18,656 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:58:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-02-27 12:58:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:58:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:18,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:58:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:18,772 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 [2019-02-27 12:58:18,774 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 [2019-02-27 12:58:18,775 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 [2019-02-27 12:58:18,776 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 [2019-02-27 12:58:18,776 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 [2019-02-27 12:58:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-27 12:58:18,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:58:18,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:58:18,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:58:18,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-27 12:58:18,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:58:18,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:58:18,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:18,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:58:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:58:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:58:18,784 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-02-27 12:58:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:18,967 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-02-27 12:58:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:58:18,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-27 12:58:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:58:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:58:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-27 12:58:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:58:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-27 12:58:18,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-02-27 12:58:18,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:18,980 INFO L225 Difference]: With dead ends: 11 [2019-02-27 12:58:18,980 INFO L226 Difference]: Without dead ends: 9 [2019-02-27 12:58:18,981 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 [2019-02-27 12:58:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-27 12:58:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-27 12:58:19,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:58:19,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-02-27 12:58:19,037 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-27 12:58:19,038 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-27 12:58:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:19,039 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-27 12:58:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-27 12:58:19,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:19,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:19,039 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-27 12:58:19,040 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-27 12:58:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:19,041 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-27 12:58:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-27 12:58:19,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:19,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:19,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:58:19,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:58:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-27 12:58:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-27 12:58:19,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-02-27 12:58:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:58:19,042 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-02-27 12:58:19,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:58:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-27 12:58:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-27 12:58:19,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:58:19,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-27 12:58:19,043 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:58:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:19,043 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-02-27 12:58:19,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:58:19,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:19,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:19,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:58:19,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:58:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:19,231 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 [2019-02-27 12:58:19,232 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 [2019-02-27 12:58:19,233 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 [2019-02-27 12:58:19,236 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 [2019-02-27 12:58:19,237 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 [2019-02-27 12:58:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:19,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:19,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:58:19,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-27 12:58:19,238 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-02-27 12:58:19,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:58:19,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:58:19,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:58:19,250 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. [2019-02-27 12:58:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:58:19,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:58:19,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:58:19,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:58:19,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:58:19,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:58:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:19,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-27 12:58:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:58:19,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:58:19,295 INFO L467 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 [2019-02-27 12:58:19,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:19,306 INFO L467 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 [2019-02-27 12:58:19,320 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:19,326 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:19,334 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:19,334 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-02-27 12:58:19,338 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:19,338 WARN L398 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)) [2019-02-27 12:58:19,338 WARN L399 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)) [2019-02-27 12:58:19,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:19,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:19,380 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-27 12:58:19,382 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:19,392 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:58:19,393 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-27 12:58:19,404 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:19,404 WARN L398 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))) [2019-02-27 12:58:19,404 WARN L399 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)) [2019-02-27 12:58:19,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:19,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:19,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:58:19,532 INFO L467 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 17 [2019-02-27 12:58:19,534 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:58:19,547 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:58:19,548 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-27 12:58:21,571 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:58:21,571 WARN L398 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))) [2019-02-27 12:58:21,571 WARN L399 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)) [2019-02-27 12:58:21,669 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 [2019-02-27 12:58:21,673 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 [2019-02-27 12:58:21,675 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 [2019-02-27 12:58:21,675 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 [2019-02-27 12:58:21,676 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 [2019-02-27 12:58:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:21,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:58:21,714 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 [2019-02-27 12:58:21,715 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 [2019-02-27 12:58:21,717 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 [2019-02-27 12:58:21,718 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 [2019-02-27 12:58:21,721 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 [2019-02-27 12:58:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:58:21,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:58:21,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-27 12:58:21,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:58:21,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-27 12:58:21,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:58:21,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2019-02-27 12:58:21,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:21,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-27 12:58:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-27 12:58:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-27 12:58:21,754 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 9 states. [2019-02-27 12:58:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:21,991 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-02-27 12:58:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-27 12:58:21,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-27 12:58:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:58:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-27 12:58:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-02-27 12:58:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-27 12:58:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-02-27 12:58:21,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2019-02-27 12:58:22,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:58:22,020 INFO L225 Difference]: With dead ends: 12 [2019-02-27 12:58:22,020 INFO L226 Difference]: Without dead ends: 0 [2019-02-27 12:58:22,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-27 12:58:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-27 12:58:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-27 12:58:22,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:58:22,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-27 12:58:22,021 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:58:22,022 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:58:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:22,022 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:58:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:58:22,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:22,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:22,023 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:58:22,023 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:58:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:58:22,023 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:58:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:58:22,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:22,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:58:22,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:58:22,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:58:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-27 12:58:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-27 12:58:22,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-27 12:58:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:58:22,024 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-27 12:58:22,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-27 12:58:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:58:22,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:58:22,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-27 12:58:22,227 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-02-27 12:58:22,236 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-27 12:58:22,236 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-27 12:58:22,237 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))) [2019-02-27 12:58:22,237 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-02-27 12:58:22,237 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-02-27 12:58:22,237 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-02-27 12:58:22,237 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-02-27 12:58:22,239 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-27 12:58:22,239 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-27 12:58:22,239 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-02-27 12:58:22,244 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-02-27 12:58:22,244 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-02-27 12:58:22,244 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-02-27 12:58:22,244 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. [2019-02-27 12:58:22,255 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.02 12:58:22 BoogieIcfgContainer [2019-02-27 12:58:22,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-27 12:58:22,257 INFO L168 Benchmark]: Toolchain (without parser) took 13431.91 ms. Allocated memory was 141.0 MB in the beginning and 255.9 MB in the end (delta: 114.8 MB). Free memory was 106.2 MB in the beginning and 133.9 MB in the end (delta: -27.7 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:22,258 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 141.0 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 12:58:22,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 103.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:22,259 INFO L168 Benchmark]: Boogie Preprocessor took 23.37 ms. Allocated memory is still 141.0 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:22,260 INFO L168 Benchmark]: RCFGBuilder took 402.70 ms. Allocated memory is still 141.0 MB. Free memory was 102.5 MB in the beginning and 91.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:22,260 INFO L168 Benchmark]: TraceAbstraction took 12941.76 ms. Allocated memory was 141.0 MB in the beginning and 255.9 MB in the end (delta: 114.8 MB). Free memory was 91.0 MB in the beginning and 133.9 MB in the end (delta: -42.8 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:22,264 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.17 ms. Allocated memory is still 141.0 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 103.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.37 ms. Allocated memory is still 141.0 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 402.70 ms. Allocated memory is still 141.0 MB. Free memory was 102.5 MB in the beginning and 91.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12941.76 ms. Allocated memory was 141.0 MB in the beginning and 255.9 MB in the end (delta: 114.8 MB). Free memory was 91.0 MB in the beginning and 133.9 MB in the end (delta: -42.8 MB). Peak memory consumption was 72.0 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, 12.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.7s 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.5s 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.7s 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...