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-10-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:11:19,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:11:19,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:11:19,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:11:19,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:11:19,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:11:19,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:11:19,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:11:19,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:11:19,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:11:19,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:11:19,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:11:19,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:11:19,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:11:19,349 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:11:19,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:11:19,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:11:19,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:11:19,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:11:19,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:11:19,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:11:19,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:11:19,363 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:11:19,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:11:19,363 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:11:19,364 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:11:19,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:11:19,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:11:19,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:11:19,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:11:19,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:11:19,368 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:11:19,369 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:11:19,369 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:11:19,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:11:19,370 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:11:19,371 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:11:19,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:11:19,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:11:19,390 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:11:19,390 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:11:19,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:11:19,391 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:11:19,391 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:11:19,391 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:11:19,391 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:11:19,391 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:11:19,392 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:11:19,392 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:11:19,392 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:11:19,392 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:11:19,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:11:19,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:11:19,393 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:11:19,393 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:11:19,393 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:11:19,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:11:19,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:11:19,394 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:11:19,394 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:11:19,394 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:11:19,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:11:19,395 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:11:19,395 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:11:19,395 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:11:19,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:11:19,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:11:19,396 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:11:19,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:11:19,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:11:19,396 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:11:19,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:11:19,397 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:11:19,397 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:11:19,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:11:19,397 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:11:19,397 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:11:19,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:11:19,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:11:19,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:11:19,457 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:11:19,457 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:11:19,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl [2018-12-18 22:11:19,458 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl' [2018-12-18 22:11:19,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:11:19,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:11:19,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:11:19,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:11:19,513 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:11:19,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:11:19,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:11:19,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:11:19,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:11:19,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/1) ... [2018-12-18 22:11:19,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:11:19,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:11:19,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:11:19,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:11:19,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (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:11:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:11:19,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:11:20,897 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:11:20,898 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2018-12-18 22:11:20,899 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:11:20 BoogieIcfgContainer [2018-12-18 22:11:20,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:11:20,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:11:20,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:11:20,903 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:11:20,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:11:19" (1/2) ... [2018-12-18 22:11:20,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71215e0 and model type speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:11:20, skipping insertion in model container [2018-12-18 22:11:20,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:11:20" (2/2) ... [2018-12-18 22:11:20,907 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-10-limited.bpl [2018-12-18 22:11:20,917 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:11:20,925 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-18 22:11:20,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-18 22:11:20,979 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:11:20,980 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:11:20,980 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:11:20,980 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:11:20,980 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:11:20,981 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:11:20,981 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:11:20,981 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:11:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-18 22:11:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:11:21,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:11:21,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:11:21,009 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:11:21,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:11:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1004, now seen corresponding path program 1 times [2018-12-18 22:11:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:11:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:11:21,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:11:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:11:21,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:11:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:11:21,363 INFO L273 TraceCheckUtils]: 0: Hoare triple {26#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;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_p9 := 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_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:11:21,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {27#false} is VALID [2018-12-18 22:11:21,383 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:11:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:11:21,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:11:21,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:11:21,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:11:21,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:11:21,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:11:21,432 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:11:21,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:11:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:11:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:11:21,446 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-18 22:11:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:11:22,058 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2018-12-18 22:11:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:11:22,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:11:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:11:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:11:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-12-18 22:11:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:11:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-12-18 22:11:22,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-12-18 22:11:22,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:11:22,286 INFO L225 Difference]: With dead ends: 45 [2018-12-18 22:11:22,286 INFO L226 Difference]: Without dead ends: 40 [2018-12-18 22:11:22,290 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:11:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-18 22:11:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2018-12-18 22:11:22,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:11:22,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 22 states. [2018-12-18 22:11:22,363 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 22 states. [2018-12-18 22:11:22,363 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 22 states. [2018-12-18 22:11:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:11:22,369 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2018-12-18 22:11:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2018-12-18 22:11:22,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:11:22,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:11:22,371 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 40 states. [2018-12-18 22:11:22,371 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 40 states. [2018-12-18 22:11:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:11:22,376 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2018-12-18 22:11:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2018-12-18 22:11:22,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:11:22,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:11:22,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:11:22,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:11:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-18 22:11:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-12-18 22:11:22,393 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 2 [2018-12-18 22:11:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:11:22,393 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2018-12-18 22:11:22,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:11:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2018-12-18 22:11:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:11:22,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:11:22,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:11:22,395 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:11:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:11:22,396 INFO L82 PathProgramCache]: Analyzing trace with hash 30392, now seen corresponding path program 1 times [2018-12-18 22:11:22,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:11:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:11:22,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:11:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:11:22,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:11:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:11:22,619 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;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_p9 := 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_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {184#(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:11:22,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#(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]; {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:11:22,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {183#false} is VALID [2018-12-18 22:11:22,650 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:11:22,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:11:22,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:11:22,651 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:11:22,653 INFO L207 CegarAbsIntRunner]: [0], [18], [43] [2018-12-18 22:11:22,693 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:11:22,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:11:22,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:11:22,840 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 122 root evaluator evaluations with a maximum evaluation depth of 3. Performed 122 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:11:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:11:22,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:11:22,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:11:22,847 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:11:22,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:11:22,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:11:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:11:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:11:22,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:11:23,432 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-18 22:11:23,504 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 33 treesize of output 36 [2018-12-18 22:11:23,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,543 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 36 treesize of output 42 [2018-12-18 22:11:23,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,608 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 38 treesize of output 52 [2018-12-18 22:11:23,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,661 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 40 treesize of output 66 [2018-12-18 22:11:23,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,749 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 42 treesize of output 84 [2018-12-18 22:11:23,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,874 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 44 treesize of output 106 [2018-12-18 22:11:23,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:23,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 132 [2018-12-18 22:11:24,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 162 [2018-12-18 22:11:24,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 196 [2018-12-18 22:11:24,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:24,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 231 [2018-12-18 22:11:24,565 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-18 22:11:24,830 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:24,953 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,050 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,124 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,312 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:25,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:25,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:25,688 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 92 treesize of output 95 [2018-12-18 22:11:25,710 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 91 treesize of output 77 [2018-12-18 22:11:25,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:25,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:25,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:25,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:25,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:25,961 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-12-18 22:11:25,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 98 [2018-12-18 22:11:26,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2018-12-18 22:11:26,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 121 [2018-12-18 22:11:26,434 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-12-18 22:11:26,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 137 [2018-12-18 22:11:26,587 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 134 [2018-12-18 22:11:26,805 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-12-18 22:11:26,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:26,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2018-12-18 22:11:26,881 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,886 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,890 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,894 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,898 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,902 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,905 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,908 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:11:26,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-18 22:11:26,982 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:155, output treesize:78 [2018-12-18 22:11:29,779 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:11:29,779 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, ULTIMATE.start_main_p10, |v_#valid_12|]. (let ((.cse1 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store (store .cse1 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1))) (let ((.cse0 (store (store .cse2 ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1))) (let ((.cse3 (store .cse0 ULTIMATE.start_main_p6 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select .cse0 ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (store (store (store (store (store (store (store (store (store (store |v_#memory_int_52| 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_p8 0) ULTIMATE.start_main_p9 0) ULTIMATE.start_main_p10 0) |#memory_int|) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select .cse2 ULTIMATE.start_main_p4)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse3 ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select (store (store .cse3 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8 1) ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2018-12-18 22:11:29,780 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (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) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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:11:32,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:11:32,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 231 [2018-12-18 22:11:32,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:11:32,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-12-18 22:11:32,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:88, output treesize:78 [2018-12-18 22:11:34,848 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:11:34,848 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p9, ULTIMATE.start_main_p3, ULTIMATE.start_main_p7, ULTIMATE.start_main_p10, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p4))) (and (= (select |v_#memory_int_53| ULTIMATE.start_main_p9) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_53| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (select |v_#memory_int_53| ULTIMATE.start_main_p8) 0) (= .cse0 0) (= (select |v_#memory_int_53| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_53| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store |v_#memory_int_53| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= (select |v_#memory_int_53| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select |v_#memory_int_53| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_53| ULTIMATE.start_main_p10)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p1) 0))) [2018-12-18 22:11:34,849 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (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)) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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:11:40,829 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;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_p9 := 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_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (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:11:43,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (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]; {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 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_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< 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_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is UNKNOWN [2018-12-18 22:11:43,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 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_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< 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_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] <= 0); {183#false} is VALID [2018-12-18 22:11:43,366 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:11:43,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:11:43,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {183#false} is VALID [2018-12-18 22:11:43,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(<= (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]; {197#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:11:43,434 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;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_p9 := 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_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {201#(<= (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:11:43,435 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:11:43,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:11:43,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-18 22:11:43,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:11:43,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:11:43,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:11:43,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:11:43,466 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:11:43,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:11:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:11:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=29, Unknown=1, NotChecked=0, Total=56 [2018-12-18 22:11:43,467 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand 4 states. [2018-12-18 22:11:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:11:43,672 INFO L93 Difference]: Finished difference Result 24 states and 53 transitions. [2018-12-18 22:11:43,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:11:43,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:11:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:11:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:11:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-12-18 22:11:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:11:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-12-18 22:11:43,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-12-18 22:11:43,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:11:43,785 INFO L225 Difference]: With dead ends: 24 [2018-12-18 22:11:43,785 INFO L226 Difference]: Without dead ends: 23 [2018-12-18 22:11:43,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=26, Invalid=29, Unknown=1, NotChecked=0, Total=56 [2018-12-18 22:11:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-18 22:11:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-18 22:11:43,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:11:43,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-12-18 22:11:43,791 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-12-18 22:11:43,791 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-12-18 22:11:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:11:43,795 INFO L93 Difference]: Finished difference Result 23 states and 52 transitions. [2018-12-18 22:11:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 52 transitions. [2018-12-18 22:11:43,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:11:43,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:11:43,796 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-12-18 22:11:43,796 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-12-18 22:11:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:11:43,798 INFO L93 Difference]: Finished difference Result 23 states and 52 transitions. [2018-12-18 22:11:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 52 transitions. [2018-12-18 22:11:43,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:11:43,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:11:43,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:11:43,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:11:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-18 22:11:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-12-18 22:11:43,802 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 3 [2018-12-18 22:11:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:11:43,802 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2018-12-18 22:11:43,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:11:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2018-12-18 22:11:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:11:43,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:11:43,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:11:43,803 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:11:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:11:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash 30020, now seen corresponding path program 1 times [2018-12-18 22:11:43,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:11:43,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:11:43,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:11:43,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:11:43,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:11:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:11:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:11:43,875 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:11:43,894 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:11:43,894 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,894 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,894 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,895 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,895 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,895 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,895 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,895 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,895 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,895 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,896 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,896 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-12-18 22:11:43,896 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-12-18 22:11:43,896 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-12-18 22:11:43,896 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2018-12-18 22:11:43,896 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2018-12-18 22:11:43,896 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-12-18 22:11:43,897 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-12-18 22:11:43,898 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-12-18 22:11:43,898 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2018-12-18 22:11:43,898 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2018-12-18 22:11:43,898 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2018-12-18 22:11:43,898 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2018-12-18 22:11:43,898 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:11:43,899 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:11:43,901 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:11:43 BoogieIcfgContainer [2018-12-18 22:11:43,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:11:43,903 INFO L168 Benchmark]: Toolchain (without parser) took 24392.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 706.2 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -124.5 MB). Peak memory consumption was 581.8 MB. Max. memory is 7.1 GB. [2018-12-18 22:11:43,904 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:11:43,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.77 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:11:43,905 INFO L168 Benchmark]: Boogie Preprocessor took 50.59 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:11:43,906 INFO L168 Benchmark]: RCFGBuilder took 1252.84 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-18 22:11:43,906 INFO L168 Benchmark]: TraceAbstraction took 23001.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -177.3 MB). Peak memory consumption was 528.9 MB. Max. memory is 7.1 GB. [2018-12-18 22:11:43,910 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.19 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 82.77 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 50.59 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 1252.84 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23001.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -177.3 MB). Peak memory consumption was 528.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 73]: assertion can be violated assertion can be violated We found a FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L51] #memory_int[p1] := #memory_int[p1] + 1; [L73] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 10 error locations. UNSAFE Result, 22.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 38 SDslu, 1 SDs, 0 SdLazy, 109 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, 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, 2 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 7 ConstructedInterpolants, 2 QuantifiedInterpolants, 411 SizeOfPredicates, 9 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 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...