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-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:12:09,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:12:09,740 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:12:09,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:12:09,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:12:09,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:12:09,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:12:09,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:12:09,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:12:09,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:12:09,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:12:09,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:12:09,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:12:09,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:12:09,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:12:09,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:12:09,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:12:09,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:12:09,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:12:09,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:12:09,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:12:09,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:12:09,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:12:09,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:12:09,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:12:09,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:12:09,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:12:09,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:12:09,794 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:12:09,795 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:12:09,795 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:12:09,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:12:09,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:12:09,796 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:12:09,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:12:09,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:12:09,800 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-18 22:12:09,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:12:09,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:12:09,828 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:12:09,829 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:12:09,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:12:09,829 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:12:09,829 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:12:09,829 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:12:09,830 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:12:09,830 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:12:09,830 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:12:09,830 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:12:09,830 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:12:09,830 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:12:09,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:12:09,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:12:09,832 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:12:09,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:12:09,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:12:09,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:12:09,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:12:09,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:12:09,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:12:09,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:12:09,836 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:12:09,836 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:12:09,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:12:09,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:12:09,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:12:09,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:12:09,837 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:12:09,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:12:09,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:12:09,838 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:12:09,838 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:12:09,838 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:12:09,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:12:09,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:12:09,839 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:12:09,839 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:12:09,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:12:09,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:12:09,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:12:09,884 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:12:09,885 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:12:09,885 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2018-12-18 22:12:09,886 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2018-12-18 22:12:09,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:12:09,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:12:09,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:09,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:12:09,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:12:09,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:09,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:09,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:09,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:12:09,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:12:09,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:12:10,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:10,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:10,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:10,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:10,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:10,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:10,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... [2018-12-18 22:12:10,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:12:10,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:12:10,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:12:10,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:12:10,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:12:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:12:10,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:12:10,590 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:12:10,591 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-18 22:12:10,591 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:12:10 BoogieIcfgContainer [2018-12-18 22:12:10,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:12:10,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:12:10,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:12:10,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:12:10,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:09" (1/2) ... [2018-12-18 22:12:10,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d96aff and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:12:10, skipping insertion in model container [2018-12-18 22:12:10,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:12:10" (2/2) ... [2018-12-18 22:12:10,600 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2018-12-18 22:12:10,611 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:12:10,619 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-18 22:12:10,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-18 22:12:10,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:12:10,666 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:12:10,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:12:10,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:12:10,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:12:10,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:12:10,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:12:10,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:12:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-18 22:12:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:12:10,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:10,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:12:10,692 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2018-12-18 22:12:10,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:10,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:10,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:10,936 INFO L273 TraceCheckUtils]: 0: Hoare triple {14#true} havoc main_p1, main_p2, main_p3, main_p4;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;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_p3 := 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_p4 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0]; {16#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:10,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {16#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {15#false} is VALID [2018-12-18 22:12:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:10,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:12:10,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:12:10,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:10,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:10,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:10,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:12:10,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:10,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:12:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:12:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:11,009 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-12-18 22:12:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:11,349 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-12-18 22:12:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:11,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-18 22:12:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-18 22:12:11,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2018-12-18 22:12:11,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:11,592 INFO L225 Difference]: With dead ends: 21 [2018-12-18 22:12:11,593 INFO L226 Difference]: Without dead ends: 16 [2018-12-18 22:12:11,596 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 [2018-12-18 22:12:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-18 22:12:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-12-18 22:12:11,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:11,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 10 states. [2018-12-18 22:12:11,669 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 10 states. [2018-12-18 22:12:11,670 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 10 states. [2018-12-18 22:12:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:11,673 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-12-18 22:12:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-12-18 22:12:11,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:11,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:11,674 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 16 states. [2018-12-18 22:12:11,674 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 16 states. [2018-12-18 22:12:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:11,677 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-12-18 22:12:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-12-18 22:12:11,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:11,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:11,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:11,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-18 22:12:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-18 22:12:11,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2018-12-18 22:12:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:11,683 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-18 22:12:11,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:12:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-18 22:12:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:11,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:11,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:11,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2018-12-18 22:12:11,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:11,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:11,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:12,110 INFO L273 TraceCheckUtils]: 0: Hoare triple {86#true} havoc main_p1, main_p2, main_p3, main_p4;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;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_p3 := 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_p4 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0]; {88#(and (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2018-12-18 22:12:12,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {88#(and (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {89#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:12,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {89#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {87#false} is VALID [2018-12-18 22:12:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:12,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:12,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:12:12,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:12:12,146 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2018-12-18 22:12:12,191 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:12:12,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:12:12,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:12:12,295 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:12:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:12,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:12:12,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:12,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:12:12,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:12,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:12:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:12,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:12:12,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-18 22:12:12,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-18 22:12:12,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:12,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:12,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-12-18 22:12:12,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-18 22:12:12,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:12,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:12,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:12,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:12,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:12,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-18 22:12:13,203 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-18 22:12:13,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:13,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:13,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-18 22:12:13,242 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:13,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:13,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-18 22:12:13,310 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-18 22:12:13,315 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:13,315 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, |v_#valid_6|]. (let ((.cse0 (store |v_#valid_6| ULTIMATE.start_main_p1 1))) (and (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0) (= |#memory_int| (store (store (store (store |v_#memory_int_22| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0)) (= 0 (select .cse0 ULTIMATE.start_main_p2)))) [2018-12-18 22:12:13,316 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) [2018-12-18 22:12:13,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:13,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2018-12-18 22:12:13,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-12-18 22:12:13,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-12-18 22:12:13,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:100 [2018-12-18 22:12:16,302 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:16,303 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_23| ULTIMATE.start_main_p4))) (and (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_23| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_23| ULTIMATE.start_main_p1) 0) (= (select |v_#memory_int_23| ULTIMATE.start_main_p2) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_23| ULTIMATE.start_main_p3) 0))) [2018-12-18 22:12:16,303 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_4, v_prenex_3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, v_prenex_6, v_prenex_5, v_prenex_1, v_prenex_2]. (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (= .cse1 0))) (or (and .cse0 (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) (and (not (= v_prenex_6 v_prenex_5)) (= (+ .cse1 1) 0) (= 0 (select |#memory_int| v_prenex_5)) (= (select |#memory_int| v_prenex_6) 0)) (and (not (= v_prenex_4 v_prenex_3)) .cse0 (not (= v_prenex_3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (= 0 (select |#memory_int| v_prenex_3)) (not (= v_prenex_4 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_4) 0)) (and .cse0 (not (= v_prenex_1 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| v_prenex_1)) (= (+ (select |#memory_int| v_prenex_2) 1) 0))))) [2018-12-18 22:12:16,509 INFO L273 TraceCheckUtils]: 0: Hoare triple {86#true} havoc main_p1, main_p2, main_p3, main_p4;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;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_p3 := 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_p4 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0]; {93#(and (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2018-12-18 22:12:16,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {93#(and (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {97#(or (and (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= 0 (select |#memory_int| v_prenex_5)) (= (select |#memory_int| v_prenex_6) 0) (not (= v_prenex_6 v_prenex_5)))) (= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0)) (and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0)))} is VALID [2018-12-18 22:12:16,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {97#(or (and (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= 0 (select |#memory_int| v_prenex_5)) (= (select |#memory_int| v_prenex_6) 0) (not (= v_prenex_6 v_prenex_5)))) (= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0)) (and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0)))} assume !(#memory_int[main_p1] <= 0); {87#false} is VALID [2018-12-18 22:12:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:16,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:12:16,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {89#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {87#false} is VALID [2018-12-18 22:12:16,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {104#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {89#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:16,569 INFO L273 TraceCheckUtils]: 0: Hoare triple {86#true} havoc main_p1, main_p2, main_p3, main_p4;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;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_p3 := 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_p4 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0]; {104#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:16,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:12:16,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-18 22:12:16,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:16,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:16,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:16,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:12:16,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:16,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:12:16,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:12:16,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:12:16,603 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 4 states. [2018-12-18 22:12:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:16,744 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2018-12-18 22:12:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:16,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-18 22:12:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-18 22:12:16,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2018-12-18 22:12:16,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:16,788 INFO L225 Difference]: With dead ends: 12 [2018-12-18 22:12:16,789 INFO L226 Difference]: Without dead ends: 11 [2018-12-18 22:12:16,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:12:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-18 22:12:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-18 22:12:16,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:16,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 10 states. [2018-12-18 22:12:16,796 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 10 states. [2018-12-18 22:12:16,797 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 10 states. [2018-12-18 22:12:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:16,798 INFO L93 Difference]: Finished difference Result 11 states and 22 transitions. [2018-12-18 22:12:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2018-12-18 22:12:16,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:16,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:16,799 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states. [2018-12-18 22:12:16,799 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states. [2018-12-18 22:12:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:16,801 INFO L93 Difference]: Finished difference Result 11 states and 22 transitions. [2018-12-18 22:12:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2018-12-18 22:12:16,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:16,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:16,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:16,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-18 22:12:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-18 22:12:16,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 3 [2018-12-18 22:12:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:16,804 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-18 22:12:16,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:12:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-18 22:12:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:16,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:16,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:16,806 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-12-18 22:12:16,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:16,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:16,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:16,877 INFO L273 TraceCheckUtils]: 0: Hoare triple {156#true} havoc main_p1, main_p2, main_p3, main_p4;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;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_p3 := 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_p4 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0]; {158#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:12:16,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {158#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] <= 0; {158#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:12:16,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {158#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] >= 0); {157#false} is VALID [2018-12-18 22:12:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:16,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:12:16,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:12:16,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:16,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:12:16,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:16,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:12:16,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:16,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:12:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:12:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:16,896 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 3 states. [2018-12-18 22:12:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:17,080 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2018-12-18 22:12:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:17,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:12:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-18 22:12:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-18 22:12:17,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-12-18 22:12:17,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:17,115 INFO L225 Difference]: With dead ends: 17 [2018-12-18 22:12:17,115 INFO L226 Difference]: Without dead ends: 16 [2018-12-18 22:12:17,116 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 [2018-12-18 22:12:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-18 22:12:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-18 22:12:17,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:17,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 12 states. [2018-12-18 22:12:17,122 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 12 states. [2018-12-18 22:12:17,122 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 12 states. [2018-12-18 22:12:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:17,124 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2018-12-18 22:12:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2018-12-18 22:12:17,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:17,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:17,124 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 16 states. [2018-12-18 22:12:17,125 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 16 states. [2018-12-18 22:12:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:17,127 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2018-12-18 22:12:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2018-12-18 22:12:17,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:17,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:17,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:17,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 22:12:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2018-12-18 22:12:17,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2018-12-18 22:12:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:17,129 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2018-12-18 22:12:17,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:12:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2018-12-18 22:12:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:17,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:17,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:17,131 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:17,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2018-12-18 22:12:17,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:17,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:17,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:17,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:17,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:17,175 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:12:17,191 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:12:17,191 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-12-18 22:12:17,191 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-12-18 22:12:17,191 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-12-18 22:12:17,191 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-12-18 22:12:17,192 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-12-18 22:12:17,192 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-12-18 22:12:17,192 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-12-18 22:12:17,192 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-12-18 22:12:17,192 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-12-18 22:12:17,192 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-12-18 22:12:17,193 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-12-18 22:12:17,193 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-12-18 22:12:17,193 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:12:17,193 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-18 22:12:17,195 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:12:17 BoogieIcfgContainer [2018-12-18 22:12:17,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:12:17,197 INFO L168 Benchmark]: Toolchain (without parser) took 7270.40 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 682.6 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -602.1 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:17,198 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:17,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:17,199 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:17,200 INFO L168 Benchmark]: RCFGBuilder took 575.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:17,201 INFO L168 Benchmark]: TraceAbstraction took 6602.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 682.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -623.2 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:17,205 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 575.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6602.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 682.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -623.2 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: assertion can be violated assertion can be violated We found a FailurePath: [L46-L47] modifies #valid; [L46-L48] ensures old(#valid)[ptr] == 0; [L46-L49] ensures #valid == old(#valid)[ptr := 1]; [L46-L47] modifies #valid; [L46-L48] ensures old(#valid)[ptr] == 0; [L46-L49] ensures #valid == old(#valid)[ptr := 1]; [L46-L47] modifies #valid; [L46-L48] ensures old(#valid)[ptr] == 0; [L46-L49] ensures #valid == old(#valid)[ptr := 1]; [L46-L47] modifies #valid; [L46-L48] ensures old(#valid)[ptr] == 0; [L46-L49] ensures #valid == old(#valid)[ptr := 1]; [L22] #memory_int[p1] := 0; [L23] #memory_int[p2] := 0; [L24] #memory_int[p3] := 0; [L25] #memory_int[p4] := 0; [L29] #memory_int[p1] := #memory_int[p1] + 1; [L39] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. UNSAFE Result, 6.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 24 SDslu, 1 SDs, 0 SdLazy, 58 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 9 ConstructedInterpolants, 2 QuantifiedInterpolants, 283 SizeOfPredicates, 3 NumberOfNonLiveVariables, 17 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...