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-fb97592 [2018-12-19 21:21:09,332 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 21:21:09,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 21:21:09,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 21:21:09,351 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 21:21:09,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 21:21:09,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 21:21:09,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 21:21:09,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 21:21:09,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 21:21:09,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 21:21:09,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 21:21:09,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 21:21:09,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 21:21:09,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 21:21:09,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 21:21:09,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 21:21:09,366 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 21:21:09,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 21:21:09,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 21:21:09,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 21:21:09,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 21:21:09,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 21:21:09,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 21:21:09,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 21:21:09,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 21:21:09,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 21:21:09,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 21:21:09,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 21:21:09,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 21:21:09,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 21:21:09,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 21:21:09,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 21:21:09,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 21:21:09,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 21:21:09,383 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 21:21:09,383 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-19 21:21:09,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 21:21:09,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 21:21:09,410 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 21:21:09,410 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 21:21:09,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 21:21:09,410 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 21:21:09,410 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 21:21:09,412 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 21:21:09,412 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-19 21:21:09,412 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 21:21:09,412 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-19 21:21:09,413 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-19 21:21:09,413 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 21:21:09,413 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 21:21:09,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 21:21:09,415 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 21:21:09,415 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 21:21:09,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 21:21:09,415 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 21:21:09,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 21:21:09,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 21:21:09,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 21:21:09,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 21:21:09,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 21:21:09,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 21:21:09,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 21:21:09,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 21:21:09,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 21:21:09,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 21:21:09,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 21:21:09,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 21:21:09,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 21:21:09,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 21:21:09,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 21:21:09,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 21:21:09,421 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 21:21:09,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 21:21:09,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 21:21:09,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 21:21:09,422 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 21:21:09,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 21:21:09,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 21:21:09,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 21:21:09,485 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 21:21:09,486 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 21:21:09,486 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 [2018-12-19 21:21:09,487 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2018-12-19 21:21:09,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 21:21:09,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 21:21:09,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 21:21:09,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 21:21:09,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 21:21:09,546 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,558 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 21:21:09,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 21:21:09,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 21:21:09,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 21:21:09,597 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,597 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,598 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,599 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,601 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,605 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,606 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 19.12 09:21:09" (1/1) ... [2018-12-19 21:21:09,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 21:21:09,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 21:21:09,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 21:21:09,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 21:21:09,610 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 19.12 09:21:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 21:21:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 21:21:09,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 21:21:09,914 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 21:21:09,914 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-19 21:21:09,915 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 09:21:09 BoogieIcfgContainer [2018-12-19 21:21:09,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 21:21:09,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 21:21:09,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 21:21:09,920 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 21:21:09,921 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 19.12 09:21:09" (1/2) ... [2018-12-19 21:21:09,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e645e7a and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 09:21:09, skipping insertion in model container [2018-12-19 21:21:09,922 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 19.12 09:21:09" (2/2) ... [2018-12-19 21:21:09,924 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2018-12-19 21:21:09,935 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 21:21:09,944 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-19 21:21:09,963 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-19 21:21:09,998 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 21:21:09,998 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 21:21:09,998 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 21:21:09,999 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 21:21:09,999 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 21:21:09,999 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 21:21:09,999 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 21:21:09,999 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 21:21:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-19 21:21:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-19 21:21:10,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:21:10,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-19 21:21:10,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:21:10,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2018-12-19 21:21:10,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:21:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:10,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:21:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:10,349 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 [2018-12-19 21:21:10,354 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 [2018-12-19 21:21:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:10,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 21:21:10,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 21:21:10,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 21:21:10,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 21:21:10,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:21:10,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 21:21:10,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:10,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 21:21:10,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 21:21:10,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 21:21:10,399 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-19 21:21:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:10,571 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-19 21:21:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 21:21:10,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 21:21:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:21:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 21:21:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 21:21:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 21:21:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 21:21:10,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2018-12-19 21:21:10,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:10,668 INFO L225 Difference]: With dead ends: 13 [2018-12-19 21:21:10,668 INFO L226 Difference]: Without dead ends: 8 [2018-12-19 21:21:10,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 21:21:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-19 21:21:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2018-12-19 21:21:10,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:21:10,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 6 states. [2018-12-19 21:21:10,752 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 6 states. [2018-12-19 21:21:10,752 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 6 states. [2018-12-19 21:21:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:10,756 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2018-12-19 21:21:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-19 21:21:10,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:10,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:10,758 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 8 states. [2018-12-19 21:21:10,758 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 8 states. [2018-12-19 21:21:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:10,764 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2018-12-19 21:21:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-19 21:21:10,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:10,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:10,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:21:10,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:21:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 21:21:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-19 21:21:10,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2018-12-19 21:21:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:21:10,775 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-19 21:21:10,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 21:21:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-19 21:21:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 21:21:10,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:21:10,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 21:21:10,776 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:21:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2018-12-19 21:21:10,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:21:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:10,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:10,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:21:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:11,045 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 [2018-12-19 21:21:11,059 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 [2018-12-19 21:21:11,073 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 [2018-12-19 21:21:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:11,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:11,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 21:21:11,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 21:21:11,077 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2018-12-19 21:21:11,123 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 21:21:11,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 21:21:11,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 21:21:11,243 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. [2018-12-19 21:21:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:11,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 21:21:11,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:11,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 21:21:11,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:11,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 21:21:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:11,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 21:21:11,451 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 [2018-12-19 21:21:11,483 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 [2018-12-19 21:21:11,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:11,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:11,547 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. [2018-12-19 21:21:11,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-19 21:21:11,551 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:11,551 WARN L384 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|) [2018-12-19 21:21:11,552 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 21:21:11,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:11,602 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 [2018-12-19 21:21:11,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:11,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:11,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-19 21:21:11,634 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:11,634 WARN L384 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))) [2018-12-19 21:21:11,634 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2018-12-19 21:21:11,656 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 [2018-12-19 21:21:11,663 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 [2018-12-19 21:21:11,664 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 [2018-12-19 21:21:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:11,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 21:21:11,741 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 [2018-12-19 21:21:11,750 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 [2018-12-19 21:21:11,764 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 [2018-12-19 21:21:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:11,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 21:21:11,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2018-12-19 21:21:11,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 21:21:11,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 21:21:11,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:21:11,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 21:21:11,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 21:21:11,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 21:21:11,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-19 21:21:11,840 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-19 21:21:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:12,063 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2018-12-19 21:21:12,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 21:21:12,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 21:21:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:21:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:21:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-19 21:21:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:21:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-19 21:21:12,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2018-12-19 21:21:12,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:12,102 INFO L225 Difference]: With dead ends: 10 [2018-12-19 21:21:12,103 INFO L226 Difference]: Without dead ends: 9 [2018-12-19 21:21:12,103 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 [2018-12-19 21:21:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-19 21:21:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-19 21:21:12,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:21:12,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 7 states. [2018-12-19 21:21:12,118 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 7 states. [2018-12-19 21:21:12,118 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 7 states. [2018-12-19 21:21:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:12,120 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 21:21:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 21:21:12,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:12,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:12,121 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 9 states. [2018-12-19 21:21:12,122 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 9 states. [2018-12-19 21:21:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:12,123 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 21:21:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 21:21:12,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:12,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:12,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:21:12,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:21:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 21:21:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-12-19 21:21:12,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2018-12-19 21:21:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:21:12,127 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2018-12-19 21:21:12,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 21:21:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2018-12-19 21:21:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 21:21:12,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:21:12,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 21:21:12,128 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:21:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2018-12-19 21:21:12,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:21:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:12,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:12,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:21:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:12,229 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 [2018-12-19 21:21:12,231 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 [2018-12-19 21:21:12,232 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 [2018-12-19 21:21:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:12,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:12,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 21:21:12,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 21:21:12,233 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2018-12-19 21:21:12,235 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 21:21:12,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 21:21:12,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 21:21:12,247 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. [2018-12-19 21:21:12,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:12,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 21:21:12,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:12,248 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 [2018-12-19 21:21:12,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:12,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 21:21:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:12,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 21:21:12,347 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 [2018-12-19 21:21:12,359 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 [2018-12-19 21:21:12,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:12,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:12,636 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 [2018-12-19 21:21:12,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:12,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:12,704 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-19 21:21:12,707 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:12,707 WARN L384 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))) [2018-12-19 21:21:12,707 WARN L385 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))) [2018-12-19 21:21:12,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:12,798 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 [2018-12-19 21:21:12,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:12,840 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. [2018-12-19 21:21:12,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-12-19 21:21:14,851 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:14,852 WARN L384 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))) [2018-12-19 21:21:14,852 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0)) [2018-12-19 21:21:14,906 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 [2018-12-19 21:21:14,908 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 [2018-12-19 21:21:14,909 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 [2018-12-19 21:21:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:14,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 21:21:14,998 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 [2018-12-19 21:21:14,999 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 [2018-12-19 21:21:15,001 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 [2018-12-19 21:21:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:15,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 21:21:15,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-19 21:21:15,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 21:21:15,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 21:21:15,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:21:15,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 21:21:15,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:15,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 21:21:15,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 21:21:15,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 21:21:15,041 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-12-19 21:21:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:15,348 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2018-12-19 21:21:15,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 21:21:15,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 21:21:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:21:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 21:21:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-19 21:21:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 21:21:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-19 21:21:15,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-12-19 21:21:15,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:15,484 INFO L225 Difference]: With dead ends: 17 [2018-12-19 21:21:15,484 INFO L226 Difference]: Without dead ends: 14 [2018-12-19 21:21:15,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-19 21:21:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-19 21:21:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-19 21:21:15,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:21:15,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 10 states. [2018-12-19 21:21:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 10 states. [2018-12-19 21:21:15,515 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 10 states. [2018-12-19 21:21:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:15,517 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-19 21:21:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2018-12-19 21:21:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:15,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:15,518 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 14 states. [2018-12-19 21:21:15,518 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 14 states. [2018-12-19 21:21:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:15,520 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-19 21:21:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2018-12-19 21:21:15,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:15,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:15,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:21:15,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:21:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 21:21:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-12-19 21:21:15,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2018-12-19 21:21:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:21:15,523 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2018-12-19 21:21:15,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 21:21:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2018-12-19 21:21:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 21:21:15,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:21:15,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 21:21:15,524 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:21:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2018-12-19 21:21:15,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:21:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:15,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:15,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:21:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:15,626 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 [2018-12-19 21:21:15,627 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 [2018-12-19 21:21:15,627 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 [2018-12-19 21:21:15,628 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 [2018-12-19 21:21:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:15,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:15,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 21:21:15,629 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 21:21:15,629 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2018-12-19 21:21:15,633 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 21:21:15,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 21:21:15,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 21:21:15,648 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. [2018-12-19 21:21:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:15,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 21:21:15,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:15,649 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 [2018-12-19 21:21:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:15,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 21:21:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:15,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 21:21:15,755 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 [2018-12-19 21:21:15,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:15,768 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 [2018-12-19 21:21:15,776 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 [2018-12-19 21:21:15,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:15,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:15,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:15,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-19 21:21:15,832 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:15,832 WARN L384 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|)) [2018-12-19 21:21:15,832 WARN L385 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))) [2018-12-19 21:21:15,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:15,889 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 [2018-12-19 21:21:15,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:15,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:15,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-19 21:21:15,912 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:15,912 WARN L384 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))) [2018-12-19 21:21:15,913 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 21:21:15,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:15,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:15,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:15,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:15,961 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 [2018-12-19 21:21:15,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:15,973 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. [2018-12-19 21:21:15,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-12-19 21:21:17,992 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:17,993 WARN L384 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)))) [2018-12-19 21:21:17,993 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 21:21:18,016 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 [2018-12-19 21:21:18,017 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 [2018-12-19 21:21:18,018 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 [2018-12-19 21:21:18,018 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 [2018-12-19 21:21:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:18,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 21:21:18,082 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 [2018-12-19 21:21:18,084 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 [2018-12-19 21:21:18,086 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 [2018-12-19 21:21:18,087 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 [2018-12-19 21:21:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:18,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 21:21:18,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 21:21:18,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 21:21:18,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 21:21:18,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:21:18,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 21:21:18,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:18,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 21:21:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 21:21:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 21:21:18,121 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2018-12-19 21:21:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:18,373 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-19 21:21:18,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 21:21:18,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 21:21:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:21:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 21:21:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-12-19 21:21:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 21:21:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-12-19 21:21:18,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-12-19 21:21:18,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:18,409 INFO L225 Difference]: With dead ends: 18 [2018-12-19 21:21:18,409 INFO L226 Difference]: Without dead ends: 15 [2018-12-19 21:21:18,410 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 [2018-12-19 21:21:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-19 21:21:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2018-12-19 21:21:18,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:21:18,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 6 states. [2018-12-19 21:21:18,444 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 6 states. [2018-12-19 21:21:18,444 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2018-12-19 21:21:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:18,447 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2018-12-19 21:21:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2018-12-19 21:21:18,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:18,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:18,448 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 15 states. [2018-12-19 21:21:18,448 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 15 states. [2018-12-19 21:21:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:18,450 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2018-12-19 21:21:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2018-12-19 21:21:18,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:18,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:18,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:21:18,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:21:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 21:21:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-19 21:21:18,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-19 21:21:18,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:21:18,452 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-19 21:21:18,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 21:21:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-19 21:21:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 21:21:18,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:21:18,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 21:21:18,453 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:21:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2018-12-19 21:21:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:21:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:18,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:18,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:21:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:18,506 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 [2018-12-19 21:21:18,507 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 [2018-12-19 21:21:18,509 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 [2018-12-19 21:21:18,509 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 [2018-12-19 21:21:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:18,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:18,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 21:21:18,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 21:21:18,510 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2018-12-19 21:21:18,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 21:21:18,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 21:21:18,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 21:21:18,549 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. [2018-12-19 21:21:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:18,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 21:21:18,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:18,550 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 [2018-12-19 21:21:18,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:18,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 21:21:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:18,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 21:21:18,579 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 [2018-12-19 21:21:18,589 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 [2018-12-19 21:21:18,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:18,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:18,609 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. [2018-12-19 21:21:18,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-19 21:21:18,613 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:18,613 WARN L384 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|) [2018-12-19 21:21:18,613 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 21:21:18,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:18,643 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 [2018-12-19 21:21:18,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:18,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:18,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-19 21:21:18,657 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:18,657 WARN L384 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)))))) [2018-12-19 21:21:18,657 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2018-12-19 21:21:18,672 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 [2018-12-19 21:21:18,673 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 [2018-12-19 21:21:18,674 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 [2018-12-19 21:21:18,674 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 [2018-12-19 21:21:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:18,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 21:21:18,701 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 [2018-12-19 21:21:18,701 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 [2018-12-19 21:21:18,703 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 [2018-12-19 21:21:18,704 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 [2018-12-19 21:21:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:18,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 21:21:18,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-19 21:21:18,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 21:21:18,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 21:21:18,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:21:18,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 21:21:18,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:18,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 21:21:18,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 21:21:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 21:21:18,731 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-19 21:21:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:18,825 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2018-12-19 21:21:18,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 21:21:18,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 21:21:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:21:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:21:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 21:21:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:21:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 21:21:18,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2018-12-19 21:21:18,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:18,855 INFO L225 Difference]: With dead ends: 12 [2018-12-19 21:21:18,855 INFO L226 Difference]: Without dead ends: 10 [2018-12-19 21:21:18,856 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 [2018-12-19 21:21:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-19 21:21:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-19 21:21:18,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:21:18,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 8 states. [2018-12-19 21:21:18,905 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 8 states. [2018-12-19 21:21:18,906 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 8 states. [2018-12-19 21:21:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:18,907 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-19 21:21:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2018-12-19 21:21:18,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:18,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:18,908 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states. [2018-12-19 21:21:18,909 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states. [2018-12-19 21:21:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:18,910 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-19 21:21:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2018-12-19 21:21:18,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:18,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:18,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:21:18,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:21:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 21:21:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-12-19 21:21:18,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2018-12-19 21:21:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:21:18,912 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2018-12-19 21:21:18,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 21:21:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2018-12-19 21:21:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 21:21:18,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:21:18,912 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-19 21:21:18,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:21:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2018-12-19 21:21:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:21:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:18,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:21:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:19,019 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 [2018-12-19 21:21:19,021 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 [2018-12-19 21:21:19,021 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 [2018-12-19 21:21:19,023 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 [2018-12-19 21:21:19,024 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 [2018-12-19 21:21:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-19 21:21:19,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 21:21:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-19 21:21:19,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 21:21:19,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 21:21:19,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:21:19,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 21:21:19,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:19,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 21:21:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 21:21:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-19 21:21:19,036 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2018-12-19 21:21:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:19,187 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2018-12-19 21:21:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 21:21:19,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 21:21:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:21:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:21:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 21:21:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:21:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 21:21:19,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2018-12-19 21:21:19,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:19,237 INFO L225 Difference]: With dead ends: 11 [2018-12-19 21:21:19,237 INFO L226 Difference]: Without dead ends: 9 [2018-12-19 21:21:19,238 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 [2018-12-19 21:21:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-19 21:21:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-19 21:21:19,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:21:19,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2018-12-19 21:21:19,305 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-19 21:21:19,305 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-19 21:21:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:19,307 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 21:21:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 21:21:19,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:19,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:19,307 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-19 21:21:19,308 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-19 21:21:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:19,309 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 21:21:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 21:21:19,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:19,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:19,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:21:19,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:21:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 21:21:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-19 21:21:19,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2018-12-19 21:21:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:21:19,311 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2018-12-19 21:21:19,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 21:21:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 21:21:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 21:21:19,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:21:19,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 21:21:19,312 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:21:19,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:19,312 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2018-12-19 21:21:19,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:21:19,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:19,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:19,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:21:19,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:21:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:19,466 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 [2018-12-19 21:21:19,468 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 [2018-12-19 21:21:19,469 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 [2018-12-19 21:21:19,475 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 [2018-12-19 21:21:19,476 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 [2018-12-19 21:21:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:19,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:19,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 21:21:19,477 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 21:21:19,477 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2018-12-19 21:21:19,479 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 21:21:19,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 21:21:19,493 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 21:21:19,493 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. [2018-12-19 21:21:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:21:19,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 21:21:19,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:21:19,494 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 [2018-12-19 21:21:19,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:21:19,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 21:21:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:21:19,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 21:21:19,555 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 [2018-12-19 21:21:19,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:19,568 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 [2018-12-19 21:21:19,577 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 [2018-12-19 21:21:19,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:19,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:19,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:19,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-19 21:21:19,604 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:19,604 WARN L384 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))) [2018-12-19 21:21:19,605 WARN L385 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))) [2018-12-19 21:21:19,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:19,642 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 [2018-12-19 21:21:19,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:19,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:21:19,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-19 21:21:19,669 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:19,670 WARN L384 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))) [2018-12-19 21:21:19,670 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 21:21:19,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:19,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:19,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:19,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:21:19,728 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 [2018-12-19 21:21:19,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:21:19,757 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. [2018-12-19 21:21:19,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2018-12-19 21:21:22,014 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:21:22,015 WARN L384 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)))) [2018-12-19 21:21:22,015 WARN L385 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)) [2018-12-19 21:21:22,105 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 [2018-12-19 21:21:22,121 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 [2018-12-19 21:21:22,130 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 [2018-12-19 21:21:22,144 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 [2018-12-19 21:21:22,153 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 [2018-12-19 21:21:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:22,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 21:21:22,234 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 [2018-12-19 21:21:22,235 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 [2018-12-19 21:21:22,236 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 [2018-12-19 21:21:22,238 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 [2018-12-19 21:21:22,242 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 [2018-12-19 21:21:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:21:22,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 21:21:22,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 21:21:22,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 21:21:22,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 21:21:22,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:21:22,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 21:21:22,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:22,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 21:21:22,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 21:21:22,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 21:21:22,278 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2018-12-19 21:21:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:22,579 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2018-12-19 21:21:22,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 21:21:22,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 21:21:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:21:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 21:21:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-19 21:21:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 21:21:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-19 21:21:22,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2018-12-19 21:21:22,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:21:22,607 INFO L225 Difference]: With dead ends: 12 [2018-12-19 21:21:22,607 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 21:21:22,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 21:21:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 21:21:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 21:21:22,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:21:22,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 21:21:22,609 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 21:21:22,609 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 21:21:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:22,609 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 21:21:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 21:21:22,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:22,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:22,610 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 21:21:22,610 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 21:21:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:21:22,610 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 21:21:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 21:21:22,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:22,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:21:22,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:21:22,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:21:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 21:21:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 21:21:22,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2018-12-19 21:21:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:21:22,612 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 21:21:22,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 21:21:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 21:21:22,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:21:22,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 21:21:22,845 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-12-19 21:21:22,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-12-19 21:21:22,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-19 21:21:22,853 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-12-19 21:21:22,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-19 21:21:22,854 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))))) [2018-12-19 21:21:22,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2018-12-19 21:21:22,854 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2018-12-19 21:21:22,856 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-19 21:21:22,856 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-19 21:21:22,856 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-12-19 21:21:22,860 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-12-19 21:21:22,860 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-12-19 21:21:22,860 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-19 21:21:22,860 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. [2018-12-19 21:21:22,872 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 09:21:22 BoogieIcfgContainer [2018-12-19 21:21:22,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 21:21:22,873 INFO L168 Benchmark]: Toolchain (without parser) took 13347.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 667.4 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -347.2 MB). Peak memory consumption was 320.2 MB. Max. memory is 7.1 GB. [2018-12-19 21:21:22,875 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 21:21:22,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 21:21:22,876 INFO L168 Benchmark]: Boogie Preprocessor took 23.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 21:21:22,876 INFO L168 Benchmark]: RCFGBuilder took 307.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-19 21:21:22,877 INFO L168 Benchmark]: TraceAbstraction took 12955.16 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 667.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -368.3 MB). Peak memory consumption was 299.1 MB. Max. memory is 7.1 GB. [2018-12-19 21:21:22,880 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 307.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12955.16 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 667.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -368.3 MB). Peak memory consumption was 299.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 31]: 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.8s 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.0s 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.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.4s 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...