java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 15:00:04,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 15:00:04,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 15:00:04,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 15:00:04,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 15:00:04,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 15:00:04,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 15:00:04,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 15:00:04,261 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 15:00:04,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 15:00:04,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 15:00:04,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 15:00:04,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 15:00:04,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 15:00:04,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 15:00:04,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 15:00:04,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 15:00:04,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 15:00:04,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 15:00:04,274 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 15:00:04,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 15:00:04,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 15:00:04,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 15:00:04,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 15:00:04,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 15:00:04,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 15:00:04,281 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 15:00:04,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 15:00:04,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 15:00:04,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 15:00:04,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 15:00:04,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 15:00:04,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 15:00:04,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 15:00:04,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 15:00:04,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 15:00:04,288 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 15:00:04,303 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 15:00:04,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 15:00:04,304 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 15:00:04,307 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 15:00:04,308 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 15:00:04,308 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 15:00:04,308 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 15:00:04,308 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 15:00:04,308 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 15:00:04,309 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 15:00:04,309 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 15:00:04,309 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 15:00:04,309 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 15:00:04,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 15:00:04,311 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 15:00:04,311 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 15:00:04,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 15:00:04,312 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 15:00:04,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 15:00:04,314 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 15:00:04,314 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 15:00:04,314 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 15:00:04,314 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 15:00:04,315 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 15:00:04,316 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 15:00:04,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 15:00:04,316 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 15:00:04,316 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 15:00:04,316 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 15:00:04,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 15:00:04,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 15:00:04,317 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 15:00:04,317 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 15:00:04,317 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 15:00:04,319 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 15:00:04,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 15:00:04,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 15:00:04,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 15:00:04,320 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 15:00:04,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 15:00:04,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 15:00:04,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 15:00:04,379 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 15:00:04,380 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 15:00:04,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-01-07 15:00:04,381 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-01-07 15:00:04,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 15:00:04,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 15:00:04,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 15:00:04,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 15:00:04,432 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 15:00:04,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 15:00:04,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 15:00:04,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 15:00:04,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 15:00:04,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... [2019-01-07 15:00:04,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 15:00:04,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 15:00:04,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 15:00:04,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 15:00:04,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 15:00:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 15:00:04,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 15:00:05,526 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 15:00:05,526 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-07 15:00:05,528 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 03:00:05 BoogieIcfgContainer [2019-01-07 15:00:05,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 15:00:05,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 15:00:05,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 15:00:05,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 15:00:05,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 03:00:04" (1/2) ... [2019-01-07 15:00:05,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477349fb and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 03:00:05, skipping insertion in model container [2019-01-07 15:00:05,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 03:00:05" (2/2) ... [2019-01-07 15:00:05,537 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-01-07 15:00:05,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 15:00:05,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-07 15:00:05,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-07 15:00:05,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 15:00:05,615 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 15:00:05,615 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 15:00:05,615 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 15:00:05,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 15:00:05,615 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 15:00:05,616 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 15:00:05,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 15:00:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-07 15:00:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 15:00:05,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 15:00:05,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 15:00:05,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-07 15:00:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 15:00:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-01-07 15:00:05,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 15:00:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 15:00:05,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 15:00:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 15:00:05,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 15:00:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 15:00:05,987 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;#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 [2019-01-07 15:00:06,006 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 [2019-01-07 15:00:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 15:00:06,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 15:00:06,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 15:00:06,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 15:00:06,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 15:00:06,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 15:00:06,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 15:00:06,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 15:00:06,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 15:00:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 15:00:06,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 15:00:06,071 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-07 15:00:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 15:00:06,534 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-01-07 15:00:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 15:00:06,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 15:00:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 15:00:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 15:00:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-01-07 15:00:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 15:00:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-01-07 15:00:06,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2019-01-07 15:00:06,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 15:00:06,795 INFO L225 Difference]: With dead ends: 33 [2019-01-07 15:00:06,796 INFO L226 Difference]: Without dead ends: 28 [2019-01-07 15:00:06,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 15:00:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-07 15:00:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-01-07 15:00:06,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 15:00:06,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2019-01-07 15:00:06,852 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2019-01-07 15:00:06,852 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2019-01-07 15:00:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 15:00:06,857 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-07 15:00:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-01-07 15:00:06,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 15:00:06,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 15:00:06,858 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2019-01-07 15:00:06,859 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2019-01-07 15:00:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 15:00:06,863 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-07 15:00:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-01-07 15:00:06,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 15:00:06,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 15:00:06,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 15:00:06,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 15:00:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 15:00:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-01-07 15:00:06,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-01-07 15:00:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 15:00:06,870 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-01-07 15:00:06,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 15:00:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-01-07 15:00:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 15:00:06,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 15:00:06,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 15:00:06,872 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-07 15:00:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 15:00:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-01-07 15:00:06,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 15:00:06,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 15:00:06,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 15:00:06,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 15:00:06,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 15:00:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 15:00:06,962 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;#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 [2019-01-07 15:00:06,969 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 [2019-01-07 15:00:06,970 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 [2019-01-07 15:00:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 15:00:06,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 15:00:06,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 15:00:06,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 15:00:06,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 15:00:06,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 15:00:06,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 15:00:06,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 15:00:06,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 15:00:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 15:00:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 15:00:07,000 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-01-07 15:00:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 15:00:07,724 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-07 15:00:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 15:00:07,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 15:00:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 15:00:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 15:00:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-07 15:00:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 15:00:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-07 15:00:07,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2019-01-07 15:00:07,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 15:00:07,832 INFO L225 Difference]: With dead ends: 28 [2019-01-07 15:00:07,832 INFO L226 Difference]: Without dead ends: 27 [2019-01-07 15:00:07,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 15:00:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-07 15:00:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-01-07 15:00:07,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 15:00:07,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2019-01-07 15:00:07,852 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2019-01-07 15:00:07,852 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2019-01-07 15:00:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 15:00:07,855 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-01-07 15:00:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-01-07 15:00:07,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 15:00:07,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 15:00:07,857 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2019-01-07 15:00:07,857 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2019-01-07 15:00:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 15:00:07,860 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-01-07 15:00:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-01-07 15:00:07,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 15:00:07,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 15:00:07,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 15:00:07,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 15:00:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 15:00:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-01-07 15:00:07,864 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-01-07 15:00:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 15:00:07,864 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-01-07 15:00:07,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 15:00:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-01-07 15:00:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 15:00:07,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 15:00:07,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 15:00:07,866 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-07 15:00:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 15:00:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-01-07 15:00:07,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 15:00:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 15:00:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 15:00:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 15:00:07,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 15:00:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 15:00:08,256 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-07 15:00:08,276 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;#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 [2019-01-07 15:00:08,279 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 [2019-01-07 15:00:08,280 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 [2019-01-07 15:00:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 15:00:08,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 15:00:08,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 15:00:08,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 15:00:08,286 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-01-07 15:00:08,351 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 15:00:08,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 15:00:14,276 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 15:00:14,277 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 15:00:14,278 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 15:00:14,279 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 15:00:14,280 WARN L224 ngHoareTripleChecker]: Pre: {2147483645#(forall ((v_idx_25 Int) (v_idx_26 Int) (v_idx_23 Int) (v_idx_24 Int) (v_idx_21 Int) (v_idx_22 Int) (v_idx_20 Int) (v_idx_18 Int) (v_idx_19 Int) (v_idx_27 Int) (v_idx_17 Int)) (exists ((v_v_66_1 Int) (v_v_67_1 Int) (v_v_68_1 Int) (v_v_74_1 Int) (v_v_73_1 Int) (v_v_95_1 Int) (v_b_54_1 Int) (v_b_40_1 Int) (v_b_41_1 Int) (v_b_37_1 Int) (v_v_2_1 Int) (v_v_94_1 Int) (v_v_72_1 Int) (v_v_93_1 Int) (v_v_4_1 Int) (v_b_36_1 Int) (v_b_55_1 Int)) (and (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_55_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_54_1)) 0) (<= (- c_ULTIMATE.start_main_p7 v_b_55_1) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_37_1)) 1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_40_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_55_1) (- 1)) (<= (- v_b_36_1 v_b_55_1) (- 1)) (<= (- v_b_54_1 v_b_55_1) (- 1)) (= v_b_40_1 c_ULTIMATE.start_main_p7) (= v_v_2_1 (select |c_old(#valid)| v_idx_24)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_23) v_v_68_1) (< v_idx_23 v_b_37_1)) (<= (- c_ULTIMATE.start_main_p7 v_b_41_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_41_1)) 1) (<= (- v_b_40_1 v_b_41_1) (- 1)) (<= (- c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) 0) (= (+ v_b_36_1 1) v_b_55_1) (<= (- v_v_94_1 (- v_v_94_1)) 0) (<= (- v_v_67_1 (- v_v_73_1)) 1) (<= (- (- v_b_41_1) (- v_b_55_1)) 0) (<= (- v_v_67_1 (- v_v_94_1)) 0) (or (<= v_b_36_1 v_idx_21) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_21) v_v_66_1)) (<= (- (- v_b_36_1) (- v_b_55_1)) 1) (<= (- v_b_37_1 v_b_54_1) 1) (<= (- c_ULTIMATE.start_main_p7 v_b_54_1) 0) (<= (- (- v_v_73_1) v_v_73_1) (- 2)) (= (select |c_old(#memory_int)| v_idx_17) v_v_4_1) (<= (- v_v_73_1 v_v_94_1) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_36_1) 0) (<= (- v_b_36_1 v_b_41_1) (- 1)) (= v_b_40_1 (+ v_b_55_1 (- 1))) (<= (- v_b_40_1 v_b_54_1) 0) (= v_b_55_1 (+ c_ULTIMATE.start_main_p7 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_36_1)) 0) (or (<= v_b_37_1 v_idx_22) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_22) v_v_67_1) (< v_idx_22 v_b_36_1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_40_1) 0) (= v_b_55_1 v_b_37_1) (<= (- v_b_40_1 v_b_55_1) (- 1)) (<= (- v_v_73_1 (- v_v_94_1)) 1) (<= (- (- v_v_94_1) v_v_94_1) 0) (<= (- (- v_b_40_1) (- v_b_41_1)) 1) (<= (- (- v_b_37_1) (- v_b_41_1)) 0) (<= (- (- v_b_37_1) (- v_b_54_1)) (- 1)) (<= (- v_b_36_1 v_b_54_1) 0) (= (+ v_b_54_1 1) v_b_55_1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_54_1)) 0) (<= (- v_v_73_1 (- v_v_73_1)) 2) (<= (- v_v_67_1 v_v_94_1) 0) (<= (- (- v_v_73_1) (- v_v_94_1)) (- 1)) (<= (- (- v_v_67_1) v_v_94_1) 0) (<= (- v_b_41_1 v_b_54_1) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_41_1) (- 1)) (<= (- (- v_b_36_1) (- v_b_41_1)) 1) (= v_b_55_1 v_b_41_1) (or (< v_idx_19 v_b_54_1) (<= v_b_55_1 v_idx_19) (= (select |c_#memory_int| v_idx_19) v_v_94_1)) (or (< v_idx_26 v_b_40_1) (<= v_b_41_1 v_idx_26) (= (select |c_#valid| v_idx_26) v_v_73_1)) (<= (- c_ULTIMATE.start_main_p7 v_b_36_1) 0) (= (+ v_b_37_1 (- 1)) v_b_40_1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_41_1)) 1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_55_1)) 1) (<= (- c_ULTIMATE.start_main_p7 v_b_40_1) 0) (= v_b_54_1 v_b_40_1) (or (= (select |c_#memory_int| v_idx_18) v_v_93_1) (<= v_b_54_1 v_idx_18)) (<= (- v_b_37_1 v_b_41_1) 0) (or (<= v_b_40_1 v_idx_25) (= (select |c_#valid| v_idx_25) v_v_72_1)) (or (= (select |c_#valid| v_idx_27) v_v_74_1) (< v_idx_27 v_b_41_1)) (<= (- (- v_b_36_1) (- v_b_40_1)) 0) (<= (- (- v_b_40_1) (- v_b_55_1)) 1) (<= (- (- v_b_54_1) (- v_b_55_1)) 1) (<= (- (- c_ULTIMATE.start_main_p7) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_40_1)) 0) (<= (- c_ULTIMATE.start_main_p7 v_b_37_1) (- 1)) (<= (- (- v_b_40_1) (- v_b_54_1)) 0) (= (+ c_ULTIMATE.start_malloc_ptr 1) v_b_55_1) (<= (- (- v_b_37_1) (- v_b_40_1)) (- 1)) (<= (- (- v_v_67_1) (- v_v_94_1)) 0) (= v_b_36_1 v_b_40_1) (<= (- v_b_41_1 v_b_55_1) 0) (<= (- v_b_36_1 v_b_37_1) (- 1)) (<= (- (- v_b_36_1) (- v_b_37_1)) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_54_1) 0) (<= (- v_b_37_1 v_b_55_1) 0) (<= (- (- v_v_67_1) (- v_v_73_1)) 1) (<= (- v_v_67_1 v_v_73_1) (- 1)) (<= (- (- v_v_73_1) v_v_94_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_36_1)) 0) (<= (- v_b_36_1 v_b_40_1) 0) (<= (- (- v_b_41_1) (- v_b_54_1)) (- 1)) (<= (- v_v_67_1 (- v_v_67_1)) 0) (<= (- v_b_37_1 v_b_40_1) 1) (<= (- (- v_v_67_1) v_v_67_1) 0) (= (+ v_b_40_1 1) v_b_55_1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_37_1)) 1) (or (= (select |c_#memory_int| v_idx_20) v_v_95_1) (< v_idx_20 v_b_55_1)) (<= (- (- v_b_36_1) (- v_b_54_1)) 0) (<= (- (- v_v_67_1) v_v_73_1) (- 1)) (<= (- (- v_b_37_1) (- v_b_55_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_37_1) (- 1)) (= c_ULTIMATE.start_malloc_ptr v_b_40_1) (= v_b_40_1 (+ v_b_41_1 (- 1))))))} [2019-01-07 15:00:14,280 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; [2019-01-07 15:00:14,281 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p4 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p4) (- 1)))) [2019-01-07 15:00:14,281 WARN L230 ngHoareTripleChecker]: Post: {2147483644#(forall ((v_idx_36 Int) (v_idx_37 Int) (v_idx_34 Int) (v_idx_35 Int) (v_idx_32 Int) (v_idx_33 Int) (v_idx_30 Int) (v_idx_31 Int) (v_idx_29 Int) (v_idx_38 Int) (v_idx_28 Int)) (exists ((v_v_97_1 Int) (v_v_66_1 Int) (v_v_98_1 Int) (v_v_67_1 Int) (v_v_68_1 Int) (v_v_96_1 Int) (v_v_74_1 Int) (v_v_73_1 Int) (v_b_40_1 Int) (v_b_41_1 Int) (v_b_37_1 Int) (v_v_2_1 Int) (v_v_72_1 Int) (v_v_4_1 Int) (v_b_57_1 Int) (v_b_36_1 Int) (v_b_56_1 Int)) (and (<= (- c_ULTIMATE.start_malloc_ptr v_b_41_1) (- 1)) (<= (- (- v_b_36_1) (- v_b_41_1)) 1) (= (+ v_b_40_1 1) (+ c_ULTIMATE.start_main_p7 1)) (= (+ v_b_40_1 1) v_b_37_1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_37_1)) 1) (= c_ULTIMATE.start_malloc_ptr v_b_36_1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_40_1)) 0) (<= (- c_ULTIMATE.start_main_p7 v_b_36_1) 0) (or (< v_idx_31 v_b_57_1) (= (select |c_#memory_int| v_idx_31) v_v_98_1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_41_1)) 1) (or (< v_idx_30 v_b_56_1) (= (select |c_#memory_int| v_idx_30) v_v_97_1) (<= v_b_57_1 v_idx_30)) (<= (- c_ULTIMATE.start_main_p7 v_b_40_1) 0) (or (= (select |c_#memory_int| v_idx_29) v_v_96_1) (<= v_b_56_1 v_idx_29)) (<= (- c_ULTIMATE.start_main_p7 v_b_41_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_41_1)) 1) (= c_ULTIMATE.start_malloc_ptr (+ v_b_41_1 (- 1))) (<= (- v_b_37_1 v_b_41_1) 0) (<= (- v_b_40_1 v_b_41_1) (- 1)) (<= (- c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) 0) (<= (- (- v_b_36_1) (- v_b_40_1)) 0) (or (< v_idx_37 v_b_40_1) (<= v_b_41_1 v_idx_37) (= (select |c_#valid| v_idx_37) v_v_73_1)) (= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p7) (<= (- (- c_ULTIMATE.start_main_p7) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- v_v_67_1 (- v_v_73_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_40_1)) 0) (= (+ v_b_40_1 1) v_b_41_1) (= (select |c_old(#memory_int)| v_idx_28) v_v_4_1) (<= (- (- v_b_56_1) (- v_b_57_1)) 1) (<= (- v_b_56_1 v_b_57_1) (- 1)) (<= (- c_ULTIMATE.start_main_p7 v_b_37_1) (- 1)) (<= (- (- v_b_37_1) (- v_b_40_1)) (- 1)) (<= (- (- v_v_73_1) v_v_73_1) (- 2)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_36_1) 0) (= (+ c_ULTIMATE.start_main_p4 1) v_b_57_1) (<= (- v_b_36_1 v_b_41_1) (- 1)) (<= (- v_b_36_1 v_b_37_1) (- 1)) (or (< v_idx_38 v_b_41_1) (= (select |c_#valid| v_idx_38) v_v_74_1)) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_56_1)) 0) (= v_v_2_1 (select |c_old(#valid)| v_idx_35)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_33) v_v_67_1) (< v_idx_33 v_b_36_1) (<= v_b_37_1 v_idx_33)) (= (+ c_ULTIMATE.start_malloc_ptr 1) (+ v_b_40_1 1)) (<= (- (- v_b_36_1) (- v_b_37_1)) 1) (= v_b_56_1 c_ULTIMATE.start_main_p4) (<= (- c_ULTIMATE.start_main_p4 v_b_56_1) 0) (<= (- c_ULTIMATE.start_main_p4 v_b_57_1) (- 1)) (<= (- (- v_v_67_1) (- v_v_73_1)) 1) (<= (- v_v_67_1 v_v_73_1) (- 1)) (= (+ v_b_40_1 1) (+ v_b_36_1 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_36_1)) 0) (= (+ v_b_56_1 1) (+ c_ULTIMATE.start_main_p4 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_40_1) 0) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_36_1)) 0) (= c_ULTIMATE.start_malloc_ptr (+ v_b_37_1 (- 1))) (or (<= v_b_36_1 v_idx_32) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_32) v_v_66_1)) (<= (- (- v_b_40_1) (- v_b_41_1)) 1) (or (= v_v_68_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_34)) (< v_idx_34 v_b_37_1)) (<= (- v_b_36_1 v_b_40_1) 0) (<= (- (- v_b_37_1) (- v_b_41_1)) 0) (<= (- v_v_67_1 (- v_v_67_1)) 0) (<= (- v_b_37_1 v_b_40_1) 1) (<= (- (- v_v_67_1) v_v_67_1) 0) (<= (- v_v_73_1 (- v_v_73_1)) 2) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_37_1)) 1) (or (<= v_b_40_1 v_idx_36) (= (select |c_#valid| v_idx_36) v_v_72_1)) (<= (- (- v_v_67_1) v_v_73_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_57_1)) 1) (= (+ v_b_57_1 (- 1)) c_ULTIMATE.start_main_p4) (<= (- c_ULTIMATE.start_malloc_ptr v_b_37_1) (- 1)) (= c_ULTIMATE.start_malloc_ptr v_b_40_1))))} [2019-01-07 15:00:14,282 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 15:00:14,728 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 15:00:14,729 WARN L269 ngHoareTripleChecker]: Simplified triple