java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:22:32,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:22:32,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:22:32,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:22:32,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:22:32,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:22:32,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:22:32,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:22:32,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:22:32,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:22:32,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:22:32,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:22:32,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:22:32,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:22:32,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:22:32,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:22:32,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:22:32,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:22:32,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:22:32,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:22:32,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:22:32,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:22:32,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:22:32,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:22:32,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:22:32,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:22:32,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:22:32,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:22:32,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:22:32,433 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:22:32,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:22:32,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:22:32,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:22:32,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:22:32,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:22:32,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:22:32,438 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-14 16:22:32,449 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:22:32,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:22:32,451 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:22:32,451 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:22:32,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:22:32,451 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:22:32,451 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:22:32,452 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:22:32,452 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-14 16:22:32,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:22:32,452 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-14 16:22:32,452 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-14 16:22:32,453 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:22:32,453 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:22:32,454 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:22:32,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:22:32,454 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:22:32,454 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:22:32,454 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:22:32,455 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:22:32,455 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:22:32,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:22:32,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:22:32,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:22:32,456 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:22:32,456 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:22:32,456 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:22:32,456 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:22:32,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:22:32,457 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:22:32,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:22:32,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:22:32,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:22:32,458 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:22:32,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:22:32,458 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:22:32,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:22:32,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:22:32,459 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:22:32,459 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:22:32,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:22:32,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:22:32,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:22:32,513 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:22:32,514 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:22:32,515 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-14 16:22:32,515 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-02-14 16:22:32,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:22:32,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:22:32,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:22:32,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:22:32,564 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:22:32,581 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,594 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:22:32,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:22:32,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:22:32,621 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:22:32,633 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,634 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,635 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,635 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,638 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,641 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,642 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 14.02 04:22:32" (1/1) ... [2019-02-14 16:22:32,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:22:32,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:22:32,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:22:32,645 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:22:32,646 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 14.02 04:22:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:22:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:22:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:22:33,074 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:22:33,074 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-14 16:22:33,076 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:22:33 BoogieIcfgContainer [2019-02-14 16:22:33,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:22:33,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:22:33,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:22:33,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:22:33,082 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 14.02 04:22:32" (1/2) ... [2019-02-14 16:22:33,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b62e5c3 and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:22:33, skipping insertion in model container [2019-02-14 16:22:33,084 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 14.02 04:22:33" (2/2) ... [2019-02-14 16:22:33,086 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-02-14 16:22:33,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:22:33,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-14 16:22:33,129 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-14 16:22:33,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:22:33,169 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:22:33,169 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:22:33,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:22:33,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:22:33,170 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:22:33,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:22:33,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:22:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-14 16:22:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-14 16:22:33,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:22:33,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-14 16:22:33,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:22:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-14 16:22:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:22:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:33,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:33,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:33,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:22:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:33,457 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-14 16:22:33,462 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-14 16:22:33,464 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-14 16:22:33,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:22:33,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-14 16:22:33,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:22:33,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-14 16:22:33,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:33,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:22:33,509 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-14 16:22:33,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:22:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:22:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:22:33,519 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-14 16:22:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:33,695 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-14 16:22:33,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:22:33,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-14 16:22:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:22:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:22:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-14 16:22:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:22:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-14 16:22:33,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2019-02-14 16:22:33,772 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-14 16:22:33,784 INFO L225 Difference]: With dead ends: 13 [2019-02-14 16:22:33,784 INFO L226 Difference]: Without dead ends: 8 [2019-02-14 16:22:33,788 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-14 16:22:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-14 16:22:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-14 16:22:33,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:22:33,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 6 states. [2019-02-14 16:22:33,860 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 6 states. [2019-02-14 16:22:33,860 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 6 states. [2019-02-14 16:22:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:33,863 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-02-14 16:22:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-14 16:22:33,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:33,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:33,864 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 8 states. [2019-02-14 16:22:33,865 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 8 states. [2019-02-14 16:22:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:33,882 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-02-14 16:22:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-14 16:22:33,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:33,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:33,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:22:33,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:22:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:22:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-14 16:22:33,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-14 16:22:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:22:33,887 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-14 16:22:33,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:22:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-14 16:22:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:22:33,888 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:22:33,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:22:33,889 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:22:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-14 16:22:33,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:22:33,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:33,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:33,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:33,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:22:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:34,178 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-14 16:22:34,191 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-14 16:22:34,204 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-14 16:22:34,205 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-14 16:22:34,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:34,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:22:34,207 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-14 16:22:34,209 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-14 16:22:34,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:22:34,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:22:34,360 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:22:34,362 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 2. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-14 16:22:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:34,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:22:34,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:34,368 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-14 16:22:34,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:34,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:22:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:34,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:22:34,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-14 16:22:34,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:22:34,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:34,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:34,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:22:34,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-14 16:22:34,663 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:34,663 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-14 16:22:34,664 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-14 16:22:34,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:34,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-14 16:22:34,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:34,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:34,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-14 16:22:34,745 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:34,746 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-14 16:22:34,746 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-02-14 16:22:34,772 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-14 16:22:34,776 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-14 16:22:34,777 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-14 16:22:34,778 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-14 16:22:34,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:22:34,853 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-14 16:22:34,854 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-14 16:22:34,857 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-14 16:22:34,857 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-14 16:22:34,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-14 16:22:34,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-14 16:22:34,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:22:34,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:22:34,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:34,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:22:34,887 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-14 16:22:34,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:22:34,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:22:34,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-14 16:22:34,888 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-14 16:22:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:35,172 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-02-14 16:22:35,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:22:35,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:22:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:22:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:22:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-02-14 16:22:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:22:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-02-14 16:22:35,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2019-02-14 16:22:35,219 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-14 16:22:35,220 INFO L225 Difference]: With dead ends: 10 [2019-02-14 16:22:35,220 INFO L226 Difference]: Without dead ends: 9 [2019-02-14 16:22:35,221 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-14 16:22:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-14 16:22:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-02-14 16:22:35,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:22:35,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 7 states. [2019-02-14 16:22:35,231 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 7 states. [2019-02-14 16:22:35,231 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 7 states. [2019-02-14 16:22:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:35,233 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-14 16:22:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-14 16:22:35,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:35,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:35,234 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 9 states. [2019-02-14 16:22:35,234 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 9 states. [2019-02-14 16:22:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:35,236 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-14 16:22:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-14 16:22:35,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:35,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:35,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:22:35,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:22:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:22:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-02-14 16:22:35,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-02-14 16:22:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:22:35,238 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-02-14 16:22:35,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:22:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-02-14 16:22:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:22:35,239 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:22:35,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:22:35,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:22:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-14 16:22:35,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:22:35,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:35,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:35,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:35,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:22:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:35,369 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-14 16:22:35,370 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-14 16:22:35,372 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-14 16:22:35,372 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-14 16:22:35,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:35,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:22:35,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-14 16:22:35,373 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-14 16:22:35,376 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:22:35,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:22:35,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:22:35,388 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 2. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-14 16:22:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:35,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:22:35,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:35,389 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-14 16:22:35,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:35,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:22:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:35,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:22:35,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-14 16:22:35,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-14 16:22:35,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:35,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:35,819 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-14 16:22:35,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:35,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:35,834 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-14 16:22:35,837 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:35,837 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-14 16:22:35,837 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-14 16:22:35,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:35,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-14 16:22:35,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:35,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:22:35,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-14 16:22:37,969 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:37,969 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-14 16:22:37,969 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0)) [2019-02-14 16:22:38,015 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-14 16:22:38,016 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-14 16:22:38,027 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-14 16:22:38,027 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-14 16:22:38,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:22:38,064 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-14 16:22:38,065 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-14 16:22:38,069 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-14 16:22:38,070 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-14 16:22:38,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:22:38,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-14 16:22:38,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:22:38,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-14 16:22:38,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:38,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-14 16:22:38,099 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-14 16:22:38,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-14 16:22:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-14 16:22:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:22:38,101 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-02-14 16:22:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:38,446 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-14 16:22:38,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:22:38,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-14 16:22:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:22:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:22:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-02-14 16:22:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:22:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-02-14 16:22:38,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2019-02-14 16:22:38,568 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-14 16:22:38,569 INFO L225 Difference]: With dead ends: 17 [2019-02-14 16:22:38,569 INFO L226 Difference]: Without dead ends: 14 [2019-02-14 16:22:38,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-14 16:22:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-14 16:22:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-02-14 16:22:38,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:22:38,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 10 states. [2019-02-14 16:22:38,596 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 10 states. [2019-02-14 16:22:38,596 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 10 states. [2019-02-14 16:22:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:38,598 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2019-02-14 16:22:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2019-02-14 16:22:38,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:38,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:38,599 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 14 states. [2019-02-14 16:22:38,599 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 14 states. [2019-02-14 16:22:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:38,601 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2019-02-14 16:22:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2019-02-14 16:22:38,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:38,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:38,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:22:38,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:22:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:22:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-02-14 16:22:38,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-02-14 16:22:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:22:38,603 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-02-14 16:22:38,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-14 16:22:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-02-14 16:22:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:22:38,604 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:22:38,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:22:38,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:22:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:38,605 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-14 16:22:38,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:22:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:38,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:38,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:22:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:38,733 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-14 16:22:38,735 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-14 16:22:38,736 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-14 16:22:38,737 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-14 16:22:38,738 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-14 16:22:38,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:38,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:22:38,738 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:22:38,739 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-14 16:22:38,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:22:38,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:22:38,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:22:38,765 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 2. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:22:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:38,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:22:38,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:38,766 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-14 16:22:38,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:38,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:22:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:38,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:22:38,842 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-14 16:22:38,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:38,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-14 16:22:38,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-14 16:22:38,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:38,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:38,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:38,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-14 16:22:38,921 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:38,921 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-14 16:22:38,921 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-14 16:22:38,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:38,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-14 16:22:38,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:38,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:38,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-14 16:22:38,995 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:38,995 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-14 16:22:38,995 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-14 16:22:39,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:39,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:39,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:39,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:39,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-14 16:22:39,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:39,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:22:39,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-14 16:22:41,327 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:41,327 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-14 16:22:41,328 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-14 16:22:41,384 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-14 16:22:41,393 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-14 16:22:41,400 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-14 16:22:41,401 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-14 16:22:41,401 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-14 16:22:41,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:22:41,448 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-14 16:22:41,450 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-14 16:22:41,451 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-14 16:22:41,453 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-14 16:22:41,453 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-14 16:22:41,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:22:41,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-14 16:22:41,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:22:41,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-14 16:22:41,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:41,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:22:41,483 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-14 16:22:41,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:22:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:22:41,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-14 16:22:41,485 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-02-14 16:22:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:41,723 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-02-14 16:22:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:22:41,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-14 16:22:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:22:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:22:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-02-14 16:22:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:22:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-02-14 16:22:41,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2019-02-14 16:22:41,767 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-14 16:22:41,768 INFO L225 Difference]: With dead ends: 18 [2019-02-14 16:22:41,768 INFO L226 Difference]: Without dead ends: 15 [2019-02-14 16:22:41,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:22:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-14 16:22:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-02-14 16:22:41,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:22:41,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 6 states. [2019-02-14 16:22:41,793 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 6 states. [2019-02-14 16:22:41,794 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2019-02-14 16:22:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:41,795 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2019-02-14 16:22:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2019-02-14 16:22:41,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:41,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:41,796 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 15 states. [2019-02-14 16:22:41,796 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 15 states. [2019-02-14 16:22:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:41,798 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2019-02-14 16:22:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2019-02-14 16:22:41,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:41,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:41,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:22:41,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:22:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:22:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-14 16:22:41,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-02-14 16:22:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:22:41,800 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-14 16:22:41,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:22:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-14 16:22:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:22:41,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:22:41,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:22:41,802 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:22:41,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-02-14 16:22:41,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:22:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:41,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:41,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:22:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:41,866 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-14 16:22:41,867 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-14 16:22:41,869 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-14 16:22:41,869 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-14 16:22:41,870 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-14 16:22:41,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:41,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:22:41,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:22:41,871 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-02-14 16:22:41,872 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:22:41,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:22:41,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:22:41,892 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 2. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-14 16:22:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:41,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:22:41,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:41,893 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-14 16:22:41,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:41,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:22:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:41,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:22:41,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-14 16:22:41,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:22:41,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:41,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:41,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:22:41,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-14 16:22:41,968 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:41,968 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-14 16:22:41,969 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-14 16:22:41,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:41,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-14 16:22:41,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-14 16:22:42,011 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:42,011 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-14 16:22:42,011 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2019-02-14 16:22:42,020 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-14 16:22:42,021 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-14 16:22:42,022 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-14 16:22:42,023 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-14 16:22:42,023 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-14 16:22:42,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:22:42,045 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-14 16:22:42,054 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-14 16:22:42,055 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-14 16:22:42,056 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-14 16:22:42,056 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-14 16:22:42,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-14 16:22:42,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-14 16:22:42,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:22:42,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:22:42,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:42,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:22:42,081 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-14 16:22:42,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:22:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:22:42,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-14 16:22:42,082 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-14 16:22:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:42,181 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-02-14 16:22:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:22:42,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:22:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:22:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:22:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-14 16:22:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:22:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-14 16:22:42,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-14 16:22:42,202 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-14 16:22:42,203 INFO L225 Difference]: With dead ends: 12 [2019-02-14 16:22:42,203 INFO L226 Difference]: Without dead ends: 10 [2019-02-14 16:22:42,204 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-14 16:22:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-14 16:22:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-02-14 16:22:42,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:22:42,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 8 states. [2019-02-14 16:22:42,236 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 8 states. [2019-02-14 16:22:42,236 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 8 states. [2019-02-14 16:22:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:42,238 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2019-02-14 16:22:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2019-02-14 16:22:42,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:42,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:42,239 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states. [2019-02-14 16:22:42,239 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states. [2019-02-14 16:22:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:42,240 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2019-02-14 16:22:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2019-02-14 16:22:42,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:42,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:42,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:22:42,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:22:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:22:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-02-14 16:22:42,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-02-14 16:22:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:22:42,242 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-02-14 16:22:42,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:22:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-02-14 16:22:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:22:42,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:22:42,243 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-14 16:22:42,243 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:22:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-02-14 16:22:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:22:42,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:42,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:42,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:22:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:42,323 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-14 16:22:42,325 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-14 16:22:42,326 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-14 16:22:42,335 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-14 16:22:42,339 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-14 16:22:42,339 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-14 16:22:42,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:22:42,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:22:42,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:22:42,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:22:42,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:42,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:22:42,350 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-14 16:22:42,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:22:42,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:22:42,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:22:42,351 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-02-14 16:22:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:42,496 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-02-14 16:22:42,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:22:42,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:22:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:22:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:22:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-14 16:22:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:22:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-14 16:22:42,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-02-14 16:22:42,547 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-14 16:22:42,547 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:22:42,548 INFO L226 Difference]: Without dead ends: 9 [2019-02-14 16:22:42,548 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-14 16:22:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-14 16:22:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-14 16:22:42,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:22:42,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-02-14 16:22:42,606 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-14 16:22:42,607 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-14 16:22:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:42,608 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-14 16:22:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-14 16:22:42,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:42,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:42,609 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-14 16:22:42,609 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-14 16:22:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:42,610 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-02-14 16:22:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-14 16:22:42,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:42,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:42,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:22:42,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:22:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-14 16:22:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-14 16:22:42,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-02-14 16:22:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:22:42,611 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-02-14 16:22:42,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:22:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-14 16:22:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:22:42,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:22:42,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:22:42,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:22:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:42,612 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-02-14 16:22:42,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:22:42,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:42,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:42,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:22:42,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:22:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:42,753 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-14 16:22:42,754 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-14 16:22:42,755 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-14 16:22:42,761 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-14 16:22:42,762 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-14 16:22:42,762 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-14 16:22:42,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:42,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:22:42,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-14 16:22:42,763 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-02-14 16:22:42,764 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:22:42,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:22:42,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:22:42,776 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 2. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:22:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:22:42,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:22:42,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:22:42,777 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-14 16:22:42,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:22:42,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:22:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:22:42,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:22:42,829 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-14 16:22:42,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-14 16:22:42,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-14 16:22:42,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,873 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-14 16:22:42,876 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:42,876 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-14 16:22:42,877 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-14 16:22:42,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:42,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-14 16:22:42,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:42,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-14 16:22:42,943 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:42,943 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-14 16:22:42,943 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-14 16:22:42,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:42,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:42,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:42,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:42,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-14 16:22:42,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:43,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:22:43,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-14 16:22:45,206 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:45,207 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-14 16:22:45,207 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-14 16:22:45,376 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-14 16:22:45,391 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-14 16:22:45,400 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-14 16:22:45,412 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-14 16:22:45,413 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-14 16:22:45,413 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-14 16:22:45,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:22:45,482 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-14 16:22:45,482 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-14 16:22:45,484 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-14 16:22:45,485 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-14 16:22:45,490 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-14 16:22:45,490 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-14 16:22:45,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:22:45,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-14 16:22:45,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:22:45,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:22:45,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:45,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:22:45,522 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-14 16:22:45,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:22:45,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:22:45,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-14 16:22:45,523 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2019-02-14 16:22:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:45,808 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-02-14 16:22:45,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:22:45,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:22:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:22:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:22:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-02-14 16:22:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:22:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-02-14 16:22:45,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2019-02-14 16:22:45,833 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-14 16:22:45,833 INFO L225 Difference]: With dead ends: 12 [2019-02-14 16:22:45,833 INFO L226 Difference]: Without dead ends: 0 [2019-02-14 16:22:45,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:22:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-14 16:22:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-14 16:22:45,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:22:45,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-14 16:22:45,835 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:22:45,835 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:22:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:45,836 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:22:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:22:45,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:45,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:45,836 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:22:45,836 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:22:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:22:45,836 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:22:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:22:45,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:45,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:22:45,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:22:45,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:22:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-14 16:22:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-14 16:22:45,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-14 16:22:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:22:45,837 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-14 16:22:45,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:22:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:22:45,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:22:45,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-14 16:22:46,085 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-02-14 16:22:46,091 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-14 16:22:46,092 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-02-14 16:22:46,092 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-14 16:22:46,092 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-02-14 16:22:46,092 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-14 16:22:46,093 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-02-14 16:22:46,093 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-02-14 16:22:46,094 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-14 16:22:46,094 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-14 16:22:46,095 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2019-02-14 16:22:46,098 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2019-02-14 16:22:46,098 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2019-02-14 16:22:46,098 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-02-14 16:22:46,098 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-14 16:22:46,108 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 04:22:46 BoogieIcfgContainer [2019-02-14 16:22:46,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-14 16:22:46,110 INFO L168 Benchmark]: Toolchain (without parser) took 13548.05 ms. Allocated memory was 140.5 MB in the beginning and 303.6 MB in the end (delta: 163.1 MB). Free memory was 106.5 MB in the beginning and 266.9 MB in the end (delta: -160.4 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-02-14 16:22:46,111 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:22:46,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.33 ms. Allocated memory is still 140.5 MB. Free memory was 106.2 MB in the beginning and 104.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-14 16:22:46,112 INFO L168 Benchmark]: Boogie Preprocessor took 23.74 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 102.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-14 16:22:46,113 INFO L168 Benchmark]: RCFGBuilder took 432.41 ms. Allocated memory is still 140.5 MB. Free memory was 102.8 MB in the beginning and 91.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-02-14 16:22:46,113 INFO L168 Benchmark]: TraceAbstraction took 13030.52 ms. Allocated memory was 140.5 MB in the beginning and 303.6 MB in the end (delta: 163.1 MB). Free memory was 91.4 MB in the beginning and 266.9 MB in the end (delta: -175.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:22:46,117 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.18 ms. Allocated memory is still 140.5 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.33 ms. Allocated memory is still 140.5 MB. Free memory was 106.2 MB in the beginning and 104.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.74 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 102.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 432.41 ms. Allocated memory is still 140.5 MB. Free memory was 102.8 MB in the beginning and 91.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13030.52 ms. Allocated memory was 140.5 MB in the beginning and 303.6 MB in the end (delta: 163.1 MB). Free memory was 91.4 MB in the beginning and 266.9 MB in the end (delta: -175.5 MB). There was no memory consumed. 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, 12.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 32 SDslu, 1 SDs, 0 SdLazy, 155 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.6s 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...