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-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:46:37,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:46:37,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:46:37,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:46:37,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:46:37,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:46:37,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:46:37,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:46:37,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:46:37,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:46:37,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:46:37,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:46:37,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:46:37,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:46:37,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:46:37,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:46:37,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:46:37,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:46:37,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:46:37,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:46:37,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:46:37,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:46:37,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:46:37,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:46:37,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:46:37,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:46:37,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:46:37,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:46:37,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:46:37,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:46:37,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:46:37,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:46:37,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:46:37,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:46:37,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:46:37,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:46:37,372 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:46:37,384 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:46:37,385 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:46:37,385 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:46:37,386 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:46:37,386 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:46:37,386 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:46:37,386 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:46:37,386 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:46:37,387 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:46:37,387 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:46:37,387 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:46:37,387 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:46:37,387 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:46:37,388 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:46:37,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:46:37,388 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:46:37,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:46:37,389 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:46:37,389 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:46:37,389 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:46:37,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:46:37,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:46:37,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:46:37,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:46:37,390 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:46:37,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:46:37,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:46:37,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:46:37,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:46:37,391 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:46:37,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:46:37,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:46:37,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:46:37,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:46:37,392 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:46:37,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:46:37,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:46:37,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:46:37,393 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:46:37,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:46:37,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:46:37,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:46:37,438 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:46:37,439 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:46:37,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2019-02-28 13:46:37,440 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-02-28 13:46:37,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:46:37,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:46:37,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:46:37,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:46:37,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:46:37,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:46:37,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:46:37,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:46:37,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:46:37,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/1) ... [2019-02-28 13:46:37,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:46:37,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:46:37,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:46:37,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:46:37,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (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:46:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:46:37,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:46:38,054 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:46:38,055 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-28 13:46:38,057 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:46:38 BoogieIcfgContainer [2019-02-28 13:46:38,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:46:38,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:46:38,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:46:38,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:46:38,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:46:37" (1/2) ... [2019-02-28 13:46:38,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1595662a and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:46:38, skipping insertion in model container [2019-02-28 13:46:38,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:46:38" (2/2) ... [2019-02-28 13:46:38,068 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-02-28 13:46:38,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:46:38,084 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 13:46:38,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 13:46:38,137 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:46:38,138 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:46:38,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:46:38,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:46:38,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:46:38,138 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:46:38,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:46:38,139 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:46:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 13:46:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:46:38,160 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:46:38,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:46:38,163 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:46:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:46:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-28 13:46:38,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:46:38,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:46:38,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:46:38,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:46:38,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:46:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:46:38,481 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {12#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:46:38,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {11#false} is VALID [2019-02-28 13:46:38,488 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:46:38,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:46:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:46:38,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:46:38,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:46:38,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:46:38,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:46:38,528 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:46:38,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:46:38,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:46:38,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:46:38,540 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 13:46:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:38,655 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-28 13:46:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:46:38,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:46:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:46:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:46:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-28 13:46:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:46:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-28 13:46:38,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2019-02-28 13:46:38,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:46:38,741 INFO L225 Difference]: With dead ends: 13 [2019-02-28 13:46:38,742 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 13:46:38,745 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:46:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 13:46:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-28 13:46:38,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:46:38,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 6 states. [2019-02-28 13:46:38,809 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 6 states. [2019-02-28 13:46:38,809 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 6 states. [2019-02-28 13:46:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:38,814 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-02-28 13:46:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-28 13:46:38,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:46:38,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:46:38,816 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 8 states. [2019-02-28 13:46:38,816 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 8 states. [2019-02-28 13:46:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:38,818 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-02-28 13:46:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-28 13:46:38,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:46:38,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:46:38,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:46:38,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:46:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:46:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 13:46:38,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-28 13:46:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:46:38,826 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-28 13:46:38,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:46:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-28 13:46:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:46:38,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:46:38,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:46:38,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:46:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:46:38,829 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-28 13:46:38,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:46:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:46:38,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:46:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:46:38,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:46:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:46:39,105 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:46:39,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:46:39,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2019-02-28 13:46:39,138 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:46:39,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:46:39,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:46:39,139 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:46:39,141 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-28 13:46:39,190 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:46:39,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:46:44,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:46:44,991 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:46:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:46:44,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:46:44,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:46:44,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:46:45,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:46:45,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:46:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:46:45,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 13:46:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:46:45,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:46:45,066 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-28 13:46:45,095 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:46:45,103 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:46:45,110 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:46:45,120 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:46:45,121 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-28 13:46:45,132 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:46:45,132 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, ULTIMATE.start_main_p2]. (= (store (store |v_#memory_int_12| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|) [2019-02-28 13:46:45,133 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-28 13:46:45,189 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-02-28 13:46:45,192 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:46:45,196 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:46:45,196 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-28 13:46:45,204 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:46:45,204 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|]. (let ((.cse0 (select |v_#memory_int_13| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_13| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-02-28 13:46:45,204 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-02-28 13:46:45,223 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:46:45,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {64#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-02-28 13:46:45,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {64#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2019-02-28 13:46:45,233 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:46:45,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:46:45,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2019-02-28 13:46:45,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {71#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:46:45,261 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {71#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2019-02-28 13:46:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:46:45,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 13:46:45,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-28 13:46:45,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:46:45,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:46:45,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:46:45,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:46:45,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:46:45,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:46:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:46:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-28 13:46:45,293 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-28 13:46:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:45,377 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-02-28 13:46:45,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:46:45,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:46:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:46:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:46:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-02-28 13:46:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:46:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-02-28 13:46:45,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2019-02-28 13:46:45,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:46:45,413 INFO L225 Difference]: With dead ends: 10 [2019-02-28 13:46:45,414 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 13:46:45,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-28 13:46:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 13:46:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-02-28 13:46:45,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:46:45,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 7 states. [2019-02-28 13:46:45,421 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 7 states. [2019-02-28 13:46:45,421 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 7 states. [2019-02-28 13:46:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:45,424 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-28 13:46:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-28 13:46:45,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:46:45,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:46:45,426 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 9 states. [2019-02-28 13:46:45,426 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 9 states. [2019-02-28 13:46:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:45,427 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-28 13:46:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-28 13:46:45,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:46:45,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:46:45,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:46:45,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:46:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:46:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-02-28 13:46:45,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-02-28 13:46:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:46:45,430 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-02-28 13:46:45,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:46:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-02-28 13:46:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:46:45,430 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:46:45,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:46:45,431 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:46:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:46:45,431 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-28 13:46:45,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:46:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:46:45,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:46:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:46:45,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:46:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:46:45,501 INFO L273 TraceCheckUtils]: 0: Hoare triple {116#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {118#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-28 13:46:45,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {118#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {119#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:46:45,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {119#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {117#false} is VALID [2019-02-28 13:46:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:46:45,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:46:45,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:46:45,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:46:45,505 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-28 13:46:45,507 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:46:45,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:47:23,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:47:23,775 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:47:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:47:23,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:47:23,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:47:23,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:47:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:47:23,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:47:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:47:23,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 13:47:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:47:23,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:47:23,815 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-28 13:47:23,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:47:23,824 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-28 13:47:23,830 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:47:23,837 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:47:23,853 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2019-02-28 13:47:23,854 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:47:23,855 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:47:23,860 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:47:23,861 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 13:47:23,863 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:47:23,864 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, |v_#valid_4|]. (and (= (select (store |v_#valid_4| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) 0) (= |#memory_int| (store (store |v_#memory_int_15| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0))) [2019-02-28 13:47:23,864 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (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))) [2019-02-28 13:47:23,893 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 13:47:23,905 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:47:23,914 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:47:23,915 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-02-28 13:47:23,931 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:47:23,931 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_16| ULTIMATE.start_main_p2))) (and (= (store |v_#memory_int_16| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_16| ULTIMATE.start_main_p1)) (= .cse0 0))) [2019-02-28 13:47:23,931 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) [2019-02-28 13:47:23,949 INFO L273 TraceCheckUtils]: 0: Hoare triple {116#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {123#(and (= (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)))} is VALID [2019-02-28 13:47:23,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {123#(and (= (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)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {127#(and (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 [2019-02-28 13:47:23,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {127#(and (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); {117#false} is VALID [2019-02-28 13:47:23,954 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:47:23,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:47:23,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {117#false} is VALID [2019-02-28 13:47:23,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {131#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:47:24,003 INFO L273 TraceCheckUtils]: 0: Hoare triple {116#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {135#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:47:24,004 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:47:24,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:47:24,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 13:47:24,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:47:24,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:47:24,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:47:24,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:47:24,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:47:24,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:47:24,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:47:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 13:47:24,051 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-02-28 13:47:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:47:24,205 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-28 13:47:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:47:24,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:47:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:47:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:47:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-02-28 13:47:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:47:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-02-28 13:47:24,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2019-02-28 13:47:24,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:47:24,247 INFO L225 Difference]: With dead ends: 17 [2019-02-28 13:47:24,247 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 13:47:24,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:47:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 13:47:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-02-28 13:47:24,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:47:24,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 10 states. [2019-02-28 13:47:24,282 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 10 states. [2019-02-28 13:47:24,282 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 10 states. [2019-02-28 13:47:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:47:24,284 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2019-02-28 13:47:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2019-02-28 13:47:24,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:47:24,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:47:24,285 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 14 states. [2019-02-28 13:47:24,285 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 14 states. [2019-02-28 13:47:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:47:24,287 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2019-02-28 13:47:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2019-02-28 13:47:24,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:47:24,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:47:24,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:47:24,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:47:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:47:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-02-28 13:47:24,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-02-28 13:47:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:47:24,290 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-02-28 13:47:24,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 13:47:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-02-28 13:47:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:47:24,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:47:24,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:47:24,291 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:47:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:47:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-28 13:47:24,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:47:24,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:47:24,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:47:24,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:47:24,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:47:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:47:24,386 INFO L273 TraceCheckUtils]: 0: Hoare triple {207#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {209#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-28 13:47:24,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {209#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {210#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-28 13:47:24,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {211#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:47:24,389 INFO L273 TraceCheckUtils]: 3: Hoare triple {211#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {208#false} is VALID [2019-02-28 13:47:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:47:24,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:47:24,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:47:24,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:47:24,391 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-28 13:47:24,393 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:47:24,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:47:28,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:47:28,755 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 13:47:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:47:28,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:47:28,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:47:28,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:47:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:47:28,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:47:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:47:28,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 13:47:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:47:28,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:47:28,802 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2019-02-28 13:47:28,806 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,809 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,817 INFO L442 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 9 treesize of output 12 [2019-02-28 13:47:28,827 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-28 13:47:28,829 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,839 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,845 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,846 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 13:47:28,848 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:47:28,849 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, |v_#valid_5|]. (and (= (select (store |v_#valid_5| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) 0) (= (store (store |v_#memory_int_18| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|)) [2019-02-28 13:47:28,849 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (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))) [2019-02-28 13:47:28,877 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 13:47:28,880 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,886 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,887 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-28 13:47:28,895 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:47:28,895 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|]. (let ((.cse0 (select |v_#memory_int_19| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_19| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 (select |v_#memory_int_19| ULTIMATE.start_main_p2)) (= .cse0 0))) [2019-02-28 13:47:28,895 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-28 13:47:28,927 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 13:47:28,931 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:47:28,944 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:47:28,945 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-02-28 13:50:55,772 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:50:55,772 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_20| ULTIMATE.start_main_p2))) (and (= .cse0 0) (= (store |v_#memory_int_20| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= 1 (select |v_#memory_int_20| ULTIMATE.start_main_p1)))) [2019-02-28 13:50:55,772 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) [2019-02-28 13:50:57,228 INFO L273 TraceCheckUtils]: 0: Hoare triple {207#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {215#(and (= (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)))} is VALID [2019-02-28 13:50:57,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#(and (= (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)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {219#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-28 13:50:57,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {223#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} is VALID [2019-02-28 13:50:57,249 INFO L273 TraceCheckUtils]: 3: Hoare triple {223#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} assume !(#memory_int[main_p1] >= 0); {208#false} is VALID [2019-02-28 13:50:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:50:57,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:50:57,364 INFO L273 TraceCheckUtils]: 3: Hoare triple {227#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {208#false} is VALID [2019-02-28 13:50:57,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {227#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:50:57,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {231#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:50:57,370 INFO L273 TraceCheckUtils]: 0: Hoare triple {207#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {235#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:50:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:50:57,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:50:57,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 13:50:57,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:50:57,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 13:50:57,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:50:57,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-28 13:50:57,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:50:57,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 13:50:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 13:50:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 13:50:57,406 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-02-28 13:50:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:50:57,699 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-02-28 13:50:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 13:50:57,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 13:50:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:50:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:50:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-02-28 13:50:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:50:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-02-28 13:50:57,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2019-02-28 13:50:57,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:50:57,738 INFO L225 Difference]: With dead ends: 18 [2019-02-28 13:50:57,739 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 13:50:57,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 13:50:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 13:50:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-02-28 13:50:57,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:50:57,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 6 states. [2019-02-28 13:50:57,804 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 6 states. [2019-02-28 13:50:57,804 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2019-02-28 13:50:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:50:57,806 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2019-02-28 13:50:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2019-02-28 13:50:57,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:50:57,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:50:57,806 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 15 states. [2019-02-28 13:50:57,807 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 15 states. [2019-02-28 13:50:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:50:57,808 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2019-02-28 13:50:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2019-02-28 13:50:57,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:50:57,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:50:57,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:50:57,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:50:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:50:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 13:50:57,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-02-28 13:50:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:50:57,811 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-28 13:50:57,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 13:50:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-28 13:50:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:50:57,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:50:57,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:50:57,811 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:50:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:50:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-02-28 13:50:57,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:50:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:50:57,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:50:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:50:57,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:50:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:50:57,863 INFO L273 TraceCheckUtils]: 0: Hoare triple {305#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:50:57,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-28 13:50:57,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-28 13:50:57,866 INFO L273 TraceCheckUtils]: 3: Hoare triple {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {306#false} is VALID [2019-02-28 13:50:57,867 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:50:57,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:50:57,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:50:57,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:50:57,868 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-02-28 13:50:57,869 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:50:57,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:51:51,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:51:51,495 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:51:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:51:51,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:51:51,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:51:51,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:51:51,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:51:51,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:51:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:51,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 13:51:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:51,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:51:51,612 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-28 13:51:51,667 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 13:51:51,674 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:51:51,681 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:51:51,686 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:51:51,686 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-28 13:51:51,689 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:51:51,690 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, ULTIMATE.start_main_p1]. (= (store (store |v_#memory_int_23| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|) [2019-02-28 13:51:51,690 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-28 13:51:51,707 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-02-28 13:51:51,709 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:51:51,713 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:51:51,713 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-02-28 13:51:51,725 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:51:51,726 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| ULTIMATE.start_main_p2))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_24| ULTIMATE.start_main_p2 (+ .cse0 (- 1)))))) [2019-02-28 13:51:51,726 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) [2019-02-28 13:51:51,738 INFO L273 TraceCheckUtils]: 0: Hoare triple {305#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:51:51,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2019-02-28 13:51:51,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume #memory_int[main_p1] >= 0; {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2019-02-28 13:51:51,741 INFO L273 TraceCheckUtils]: 3: Hoare triple {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume !(#memory_int[main_p2] <= 0); {306#false} is VALID [2019-02-28 13:51:51,742 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:51:51,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:51:51,771 INFO L273 TraceCheckUtils]: 3: Hoare triple {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {306#false} is VALID [2019-02-28 13:51:51,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:51:51,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {329#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:51:51,776 INFO L273 TraceCheckUtils]: 0: Hoare triple {305#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {329#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} is VALID [2019-02-28 13:51:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:51:51,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 13:51:51,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 13:51:51,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:51:51,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 13:51:51,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:51:51,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:51:51,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:51,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:51:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:51:51,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:51:51,811 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-28 13:51:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:51,903 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-02-28 13:51:51,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:51:51,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 13:51:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:51:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:51:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:51:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:51:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:51:51,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-28 13:51:51,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:51,930 INFO L225 Difference]: With dead ends: 12 [2019-02-28 13:51:51,931 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 13:51:51,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:51:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 13:51:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-02-28 13:51:51,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:51:51,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 8 states. [2019-02-28 13:51:51,978 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 8 states. [2019-02-28 13:51:51,978 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 8 states. [2019-02-28 13:51:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:51,980 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2019-02-28 13:51:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2019-02-28 13:51:51,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:51,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:51,981 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states. [2019-02-28 13:51:51,982 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states. [2019-02-28 13:51:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:51,983 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2019-02-28 13:51:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2019-02-28 13:51:51,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:51,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:51,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:51:51,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:51:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:51:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-02-28 13:51:51,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-02-28 13:51:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:51:51,986 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-02-28 13:51:51,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:51:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-02-28 13:51:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:51:51,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:51:51,987 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 13:51:51,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:51:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:51:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-02-28 13:51:51,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:51:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:51,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:51:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:51,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:51:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:52,108 INFO L273 TraceCheckUtils]: 0: Hoare triple {382#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-28 13:51:52,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-28 13:51:52,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-28 13:51:52,113 INFO L273 TraceCheckUtils]: 3: Hoare triple {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {385#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:51:52,114 INFO L273 TraceCheckUtils]: 4: Hoare triple {385#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {383#false} is VALID [2019-02-28 13:51:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 13:51:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:51:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:51:52,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:51:52,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:51:52,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:51:52,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:51:52,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:52,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:51:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:51:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:51:52,161 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-02-28 13:51:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:52,290 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-02-28 13:51:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:51:52,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:51:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:51:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:51:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-28 13:51:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:51:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-28 13:51:52,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-02-28 13:51:52,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:52,345 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:51:52,346 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 13:51:52,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:51:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 13:51:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 13:51:52,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:51:52,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-02-28 13:51:52,431 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-28 13:51:52,431 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-28 13:51:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:52,433 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-28 13:51:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-28 13:51:52,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:52,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:52,433 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-28 13:51:52,434 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-28 13:51:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:52,435 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-28 13:51:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-28 13:51:52,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:52,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:52,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:51:52,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:51:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 13:51:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-28 13:51:52,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-02-28 13:51:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:51:52,437 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-02-28 13:51:52,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:51:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-28 13:51:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:51:52,438 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:51:52,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:51:52,438 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:51:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:51:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-02-28 13:51:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:51:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:52,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:51:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:52,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:51:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:52,585 INFO L273 TraceCheckUtils]: 0: Hoare triple {438#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {440#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2019-02-28 13:51:52,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {440#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {441#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-28 13:51:52,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-28 13:51:52,593 INFO L273 TraceCheckUtils]: 3: Hoare triple {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-28 13:51:52,597 INFO L273 TraceCheckUtils]: 4: Hoare triple {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {439#false} is VALID [2019-02-28 13:51:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:51:52,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:51:52,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:51:52,599 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 13:51:52,599 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-02-28 13:51:52,602 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:51:52,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:51:59,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:51:59,890 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 13:51:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:51:59,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:51:59,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:51:59,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:51:59,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:51:59,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:51:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:59,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 13:51:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:59,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:51:59,954 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2019-02-28 13:51:59,955 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:51:59,958 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:51:59,968 INFO L442 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 9 treesize of output 12 [2019-02-28 13:51:59,977 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-28 13:51:59,981 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:51:59,990 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:51:59,999 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:52:00,000 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 13:52:00,003 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:52:00,004 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, |v_#valid_6|]. (and (= |#memory_int| (store (store |v_#memory_int_26| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0)) (= 0 (select (store |v_#valid_6| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2))) [2019-02-28 13:52:00,004 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (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))) [2019-02-28 13:52:00,052 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 13:52:00,059 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:52:00,067 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:52:00,067 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-02-28 13:52:00,087 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:52:00,087 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p2))) (and (= 0 .cse0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_27| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_27| ULTIMATE.start_main_p1) 0))) [2019-02-28 13:52:00,088 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) [2019-02-28 13:52:00,134 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 13:52:00,158 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:52:00,166 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:52:00,167 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-28 13:52:00,207 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:52:00,208 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_28| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_28| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0) (= 0 (+ (select |v_#memory_int_28| ULTIMATE.start_main_p2) 1)))) [2019-02-28 13:52:00,208 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-02-28 13:52:00,261 INFO L273 TraceCheckUtils]: 0: Hoare triple {438#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {446#(and (= (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)))} is VALID [2019-02-28 13:52:00,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {446#(and (= (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)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {450#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} is VALID [2019-02-28 13:52:00,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-28 13:52:00,264 INFO L273 TraceCheckUtils]: 3: Hoare triple {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-28 13:52:00,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {439#false} is VALID [2019-02-28 13:52:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:52:00,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:52:00,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {439#false} is VALID [2019-02-28 13:52:00,322 INFO L273 TraceCheckUtils]: 3: Hoare triple {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:52:00,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {468#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:52:00,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {472#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {468#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:52:00,330 INFO L273 TraceCheckUtils]: 0: Hoare triple {438#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {472#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:52:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:52:00,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:52:00,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 13:52:00,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:52:00,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 13:52:00,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:52:00,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-28 13:52:00,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:52:00,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 13:52:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 13:52:00,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 13:52:00,376 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2019-02-28 13:52:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:52:00,892 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-02-28 13:52:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 13:52:00,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 13:52:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:52:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:52:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-02-28 13:52:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:52:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-02-28 13:52:00,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2019-02-28 13:52:00,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:52:00,925 INFO L225 Difference]: With dead ends: 12 [2019-02-28 13:52:00,925 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 13:52:00,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 13:52:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 13:52:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 13:52:00,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:52:00,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-28 13:52:00,927 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:52:00,927 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:52:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:52:00,928 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:52:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:52:00,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:52:00,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:52:00,928 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:52:00,928 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:52:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:52:00,928 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:52:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:52:00,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:52:00,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:52:00,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:52:00,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:52:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 13:52:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 13:52:00,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-28 13:52:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:52:00,929 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 13:52:00,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 13:52:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:52:00,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:52:00,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 13:52:01,673 WARN L181 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-02-28 13:52:01,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 13:52:01,698 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-02-28 13:52:01,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 13:52:01,699 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse3 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 .cse3)) (and (= .cse2 0) (= 0 .cse3))))) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p2))) (or (and .cse0 (= 0 .cse1)) (and .cse0 (<= (+ .cse1 1) 0))))) [2019-02-28 13:52:01,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-02-28 13:52:01,699 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-02-28 13:52:01,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-02-28 13:52:01,702 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-28 13:52:01,702 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-28 13:52:01,702 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2019-02-28 13:52:01,724 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2019-02-28 13:52:01,724 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2019-02-28 13:52:01,724 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-02-28 13:52:01,724 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-28 13:52:01,733 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:52:01 BoogieIcfgContainer [2019-02-28 13:52:01,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:52:01,736 INFO L168 Benchmark]: Toolchain (without parser) took 324256.67 ms. Allocated memory was 141.0 MB in the beginning and 677.9 MB in the end (delta: 536.9 MB). Free memory was 108.6 MB in the beginning and 299.9 MB in the end (delta: -191.2 MB). Peak memory consumption was 345.6 MB. Max. memory is 7.1 GB. [2019-02-28 13:52:01,737 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:52:01,738 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.61 ms. Allocated memory is still 141.0 MB. Free memory was 108.4 MB in the beginning and 106.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-28 13:52:01,738 INFO L168 Benchmark]: Boogie Preprocessor took 20.54 ms. Allocated memory is still 141.0 MB. Free memory was 106.2 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 13:52:01,739 INFO L168 Benchmark]: RCFGBuilder took 503.14 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-02-28 13:52:01,740 INFO L168 Benchmark]: TraceAbstraction took 323675.42 ms. Allocated memory was 141.0 MB in the beginning and 677.9 MB in the end (delta: 536.9 MB). Free memory was 93.6 MB in the beginning and 299.9 MB in the end (delta: -206.3 MB). Peak memory consumption was 330.6 MB. Max. memory is 7.1 GB. [2019-02-28 13:52:01,744 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 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.61 ms. Allocated memory is still 141.0 MB. Free memory was 108.4 MB in the beginning and 106.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.54 ms. Allocated memory is still 141.0 MB. Free memory was 106.2 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.14 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 323675.42 ms. Allocated memory was 141.0 MB in the beginning and 677.9 MB in the end (delta: 536.9 MB). Free memory was 93.6 MB in the beginning and 299.9 MB in the end (delta: -206.3 MB). Peak memory consumption was 330.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 323.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 32 SDslu, 1 SDs, 0 SdLazy, 155 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 109.4s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 210.7s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 4 QuantifiedInterpolants, 1521 SizeOfPredicates, 11 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...