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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:54:38,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:54:38,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:54:38,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:54:38,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:54:38,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:54:38,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:54:38,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:54:38,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:54:38,770 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:54:38,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:54:38,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:54:38,772 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:54:38,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:54:38,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:54:38,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:54:38,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:54:38,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:54:38,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:54:38,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:54:38,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:54:38,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:54:38,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:54:38,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:54:38,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:54:38,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:54:38,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:54:38,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:54:38,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:54:38,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:54:38,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:54:38,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:54:38,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:54:38,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:54:38,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:54:38,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:54:38,794 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 13:54:38,806 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:54:38,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:54:38,807 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:54:38,808 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:54:38,808 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:54:38,808 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:54:38,808 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:54:38,808 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:54:38,809 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:54:38,809 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:54:38,809 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:54:38,809 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:54:38,809 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:54:38,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:54:38,810 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:54:38,810 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:54:38,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:54:38,811 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:54:38,811 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:54:38,811 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:54:38,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:54:38,811 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:54:38,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:54:38,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:54:38,812 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:54:38,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:54:38,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:54:38,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:54:38,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:54:38,813 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:54:38,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:54:38,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:54:38,814 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:54:38,814 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:54:38,814 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:54:38,814 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:54:38,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:54:38,815 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:54:38,815 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:54:38,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:54:38,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:54:38,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:54:38,886 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:54:38,886 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:54:38,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl [2019-02-28 13:54:38,888 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl' [2019-02-28 13:54:38,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:54:38,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:54:38,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:54:38,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:54:38,955 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:54:38,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:38,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:54:39,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:54:39,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:54:39,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:54:39,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... [2019-02-28 13:54:39,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:54:39,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:54:39,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:54:39,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:54:39,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:54:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:54:39,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:54:40,292 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:54:40,294 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-02-28 13:54:40,295 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:54:40 BoogieIcfgContainer [2019-02-28 13:54:40,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:54:40,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:54:40,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:54:40,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:54:40,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:54:38" (1/2) ... [2019-02-28 13:54:40,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25852bbd and model type speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:54:40, skipping insertion in model container [2019-02-28 13:54:40,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:54:40" (2/2) ... [2019-02-28 13:54:40,308 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-limited.bpl [2019-02-28 13:54:40,317 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:54:40,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-02-28 13:54:40,341 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-02-28 13:54:40,374 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:54:40,374 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:54:40,374 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:54:40,374 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:54:40,374 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:54:40,375 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:54:40,375 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:54:40,375 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:54:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-02-28 13:54:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:54:40,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:54:40,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:54:40,400 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:54:40,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:54:40,406 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-02-28 13:54:40,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:54:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:54:40,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:54:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:54:40,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:54:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:54:40,655 INFO L273 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;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;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_p5 := 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_p6 := 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_p7 := 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_p8 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;#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];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0]; {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:54:40,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {23#false} is VALID [2019-02-28 13:54:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:54:40,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:54:40,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:54:40,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:54:40,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:54:40,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:54:40,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:54:40,705 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-28 13:54:40,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:54:40,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:54:40,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:54:40,717 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-02-28 13:54:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:54:41,149 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-02-28 13:54:41,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:54:41,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:54:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:54:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:54:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-02-28 13:54:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:54:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-02-28 13:54:41,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2019-02-28 13:54:41,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:54:41,282 INFO L225 Difference]: With dead ends: 37 [2019-02-28 13:54:41,282 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 13:54:41,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:54:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 13:54:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-02-28 13:54:41,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:54:41,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 18 states. [2019-02-28 13:54:41,317 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 18 states. [2019-02-28 13:54:41,317 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 18 states. [2019-02-28 13:54:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:54:41,322 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-02-28 13:54:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-02-28 13:54:41,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:54:41,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:54:41,323 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 32 states. [2019-02-28 13:54:41,323 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 32 states. [2019-02-28 13:54:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:54:41,328 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-02-28 13:54:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-02-28 13:54:41,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:54:41,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:54:41,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:54:41,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:54:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 13:54:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-02-28 13:54:41,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-02-28 13:54:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:54:41,334 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-02-28 13:54:41,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:54:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-02-28 13:54:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:54:41,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:54:41,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:54:41,336 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:54:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:54:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-02-28 13:54:41,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:54:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:54:41,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:54:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:54:41,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:54:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:54:41,719 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 13:54:41,852 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;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;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_p5 := 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_p6 := 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_p7 := 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_p8 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;#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];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0]; {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} is VALID [2019-02-28 13:54:41,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:54:41,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-02-28 13:54:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:54:41,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:54:41,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:54:41,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:54:41,861 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-02-28 13:54:41,909 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:54:41,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)