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-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:12:35,265 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:12:35,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:12:35,286 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:12:35,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:12:35,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:12:35,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:12:35,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:12:35,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:12:35,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:12:35,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:12:35,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:12:35,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:12:35,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:12:35,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:12:35,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:12:35,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:12:35,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:12:35,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:12:35,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:12:35,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:12:35,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:12:35,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:12:35,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:12:35,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:12:35,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:12:35,312 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:12:35,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:12:35,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:12:35,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:12:35,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:12:35,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:12:35,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:12:35,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:12:35,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:12:35,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:12:35,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-18 22:12:35,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:12:35,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:12:35,340 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:12:35,340 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:12:35,340 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:12:35,340 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:12:35,341 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:12:35,341 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:12:35,341 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:12:35,341 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:12:35,341 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:12:35,342 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:12:35,342 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:12:35,342 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:12:35,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:12:35,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:12:35,344 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:12:35,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:12:35,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:12:35,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:12:35,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:12:35,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:12:35,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:12:35,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:12:35,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:12:35,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:12:35,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:12:35,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:12:35,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:12:35,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:12:35,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:12:35,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:12:35,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:12:35,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:12:35,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:12:35,350 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:12:35,351 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:12:35,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:12:35,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:12:35,352 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:12:35,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:12:35,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:12:35,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:12:35,425 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:12:35,426 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:12:35,426 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2018-12-18 22:12:35,427 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2018-12-18 22:12:35,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:12:35,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:12:35,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:35,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:12:35,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:12:35,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:35,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:12:35,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:12:35,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:12:35,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... [2018-12-18 22:12:35,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:12:35,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:12:35,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:12:35,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:12:35,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:12:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:12:35,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:12:36,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:12:36,603 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-18 22:12:36,604 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:12:36 BoogieIcfgContainer [2018-12-18 22:12:36,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:12:36,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:12:36,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:12:36,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:12:36,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:35" (1/2) ... [2018-12-18 22:12:36,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ec2596 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:12:36, skipping insertion in model container [2018-12-18 22:12:36,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:12:36" (2/2) ... [2018-12-18 22:12:36,612 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2018-12-18 22:12:36,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:12:36,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-18 22:12:36,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-18 22:12:36,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:12:36,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:12:36,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:12:36,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:12:36,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:12:36,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:12:36,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:12:36,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:12:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-18 22:12:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:12:36,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:36,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:12:36,712 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2018-12-18 22:12:36,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:36,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:36,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:37,045 INFO L273 TraceCheckUtils]: 0: Hoare triple {20#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:37,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {21#false} is VALID [2018-12-18 22:12:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:37,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:12:37,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:12:37,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:37,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:37,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:37,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:12:37,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:37,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:12:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:12:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:37,130 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-18 22:12:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:37,640 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-12-18 22:12:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:37,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-18 22:12:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-18 22:12:37,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-12-18 22:12:37,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:37,860 INFO L225 Difference]: With dead ends: 33 [2018-12-18 22:12:37,860 INFO L226 Difference]: Without dead ends: 28 [2018-12-18 22:12:37,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-18 22:12:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-18 22:12:37,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:37,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2018-12-18 22:12:37,943 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2018-12-18 22:12:37,943 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2018-12-18 22:12:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:37,948 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 22:12:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-18 22:12:37,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:37,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:37,950 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2018-12-18 22:12:37,950 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2018-12-18 22:12:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:37,955 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 22:12:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-18 22:12:37,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:37,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:37,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:37,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-18 22:12:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-18 22:12:37,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2018-12-18 22:12:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:37,961 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-18 22:12:37,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:12:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-18 22:12:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:37,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:37,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:37,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2018-12-18 22:12:37,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:37,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:37,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:37,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:37,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:38,048 INFO L273 TraceCheckUtils]: 0: Hoare triple {134#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:12:38,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] <= 0; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:12:38,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] >= 0); {135#false} is VALID [2018-12-18 22:12:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:38,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:12:38,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:12:38,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:38,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:12:38,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:38,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:12:38,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:38,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:12:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:12:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:38,103 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2018-12-18 22:12:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:38,563 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 22:12:38,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:38,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:12:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-18 22:12:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-18 22:12:38,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-12-18 22:12:38,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:38,693 INFO L225 Difference]: With dead ends: 28 [2018-12-18 22:12:38,693 INFO L226 Difference]: Without dead ends: 27 [2018-12-18 22:12:38,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-18 22:12:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-18 22:12:38,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:38,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2018-12-18 22:12:38,701 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2018-12-18 22:12:38,701 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2018-12-18 22:12:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:38,704 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-18 22:12:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-18 22:12:38,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:38,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:38,706 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2018-12-18 22:12:38,706 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2018-12-18 22:12:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:38,709 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-18 22:12:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-18 22:12:38,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:38,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:38,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:38,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-18 22:12:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-12-18 22:12:38,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2018-12-18 22:12:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:38,717 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2018-12-18 22:12:38,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:12:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2018-12-18 22:12:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:38,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:38,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:38,718 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:38,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2018-12-18 22:12:38,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:38,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:38,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:39,108 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-18 22:12:39,161 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-18 22:12:39,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:39,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {243#false} is VALID [2018-12-18 22:12:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:39,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:39,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:12:39,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:12:39,169 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2018-12-18 22:12:39,204 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:12:39,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:12:39,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:12:39,348 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:12:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:39,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:12:39,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:39,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:12:39,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:39,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:12:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:39,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:12:40,082 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-18 22:12:40,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-12-18 22:12:40,173 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-12-18 22:12:40,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-12-18 22:12:40,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-12-18 22:12:40,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-18 22:12:40,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:40,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:40,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:40,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:40,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:40,608 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 24 treesize of output 27 [2018-12-18 22:12:40,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-12-18 22:12:40,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-12-18 22:12:40,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-12-18 22:12:40,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-12-18 22:12:40,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2018-12-18 22:12:40,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:40,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2018-12-18 22:12:40,895 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:40,998 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:41,063 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:41,092 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:41,116 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:41,134 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:41,153 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:41,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-18 22:12:41,196 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2018-12-18 22:12:41,567 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:41,567 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_9|]. (let ((.cse0 (store |v_#valid_9| ULTIMATE.start_main_p1 1))) (and (= (select .cse0 ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select (store (store (store (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6) 0) (= |#memory_int| (store (store (store (store (store (store (store |v_#memory_int_37| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-18 22:12:41,568 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:12:41,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:41,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2018-12-18 22:12:41,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:42,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-18 22:12:42,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2018-12-18 22:12:44,066 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:44,067 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_38| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_38| ULTIMATE.start_main_p2) 0) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (store |v_#memory_int_38| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_38| ULTIMATE.start_main_p6) 0) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 .cse0) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p1)))) [2018-12-18 22:12:44,067 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:12:45,336 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {249#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2018-12-18 22:12:45,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {249#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {253#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2018-12-18 22:12:45,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {253#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] <= 0); {243#false} is VALID [2018-12-18 22:12:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:45,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:12:45,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {257#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {243#false} is VALID [2018-12-18 22:12:45,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {257#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:45,651 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {261#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:45,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:12:45,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-18 22:12:45,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:45,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:45,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:45,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:12:45,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:45,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:12:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:12:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:12:45,678 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 4 states. [2018-12-18 22:12:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:45,798 INFO L93 Difference]: Finished difference Result 19 states and 39 transitions. [2018-12-18 22:12:45,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:45,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-12-18 22:12:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-12-18 22:12:45,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2018-12-18 22:12:45,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:45,839 INFO L225 Difference]: With dead ends: 19 [2018-12-18 22:12:45,839 INFO L226 Difference]: Without dead ends: 18 [2018-12-18 22:12:45,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:12:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-18 22:12:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-18 22:12:45,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:45,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:45,846 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:45,846 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:45,849 INFO L93 Difference]: Finished difference Result 18 states and 38 transitions. [2018-12-18 22:12:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2018-12-18 22:12:45,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:45,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:45,850 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:45,850 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:45,852 INFO L93 Difference]: Finished difference Result 18 states and 38 transitions. [2018-12-18 22:12:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2018-12-18 22:12:45,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:45,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:45,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:45,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-18 22:12:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2018-12-18 22:12:45,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 3 [2018-12-18 22:12:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:45,856 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. [2018-12-18 22:12:45,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:12:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2018-12-18 22:12:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:45,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:45,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:45,857 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2018-12-18 22:12:45,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:45,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:45,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:45,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:45,919 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:12:45,936 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:12:45,937 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,937 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,937 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,937 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,937 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,937 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,937 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-12-18 22:12:45,938 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-12-18 22:12:45,939 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2018-12-18 22:12:45,939 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2018-12-18 22:12:45,939 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-12-18 22:12:45,939 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-12-18 22:12:45,939 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-12-18 22:12:45,939 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-12-18 22:12:45,939 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:12:45,940 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-18 22:12:45,942 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:12:45 BoogieIcfgContainer [2018-12-18 22:12:45,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:12:45,943 INFO L168 Benchmark]: Toolchain (without parser) took 10443.77 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.9 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -466.2 MB). Peak memory consumption was 211.7 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:45,944 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-18 22:12:45,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:45,945 INFO L168 Benchmark]: Boogie Preprocessor took 28.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:45,946 INFO L168 Benchmark]: RCFGBuilder took 1010.29 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:45,947 INFO L168 Benchmark]: TraceAbstraction took 9337.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -497.9 MB). Peak memory consumption was 180.0 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:45,950 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 62.78 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 28.06 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 1010.29 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9337.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -497.9 MB). Peak memory consumption was 180.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: assertion can be violated assertion can be violated We found a FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L42] #memory_int[p1] := #memory_int[p1] + 1; [L58] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 7 error locations. UNSAFE Result, 9.2s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 36 SDslu, 1 SDs, 0 SdLazy, 114 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 9 ConstructedInterpolants, 2 QuantifiedInterpolants, 335 SizeOfPredicates, 6 NumberOfNonLiveVariables, 29 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...