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/20170304-DifficultPathPrograms/matrix.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:31:05,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:05,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:05,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:05,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:05,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:05,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:05,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:05,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:05,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:05,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:05,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:05,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:05,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:05,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:05,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:05,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:05,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:05,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:05,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:05,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:05,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:05,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:05,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:05,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:05,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:05,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:05,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:05,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:05,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:05,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:05,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:05,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:05,183 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:05,184 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:05,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:05,185 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:31:05,208 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:05,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:05,209 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:05,209 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:05,209 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:05,209 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:05,210 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:05,210 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:05,210 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:05,211 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:05,211 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:05,211 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:05,211 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:05,211 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:05,212 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:05,212 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:05,213 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:05,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:05,213 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:05,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:05,213 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:05,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:05,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:05,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:05,214 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:05,214 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:05,214 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:05,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:05,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:05,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:05,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:05,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:05,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:05,218 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:05,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:05,219 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:05,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:05,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:05,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:05,220 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:05,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:05,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:05,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:05,284 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:05,285 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:05,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl [2019-01-31 14:31:05,286 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl' [2019-01-31 14:31:05,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:05,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:05,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:05,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:05,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:05,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:05,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:05,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:05,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:05,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/1) ... [2019-01-31 14:31:05,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:05,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:05,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:05,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:05,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:31:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:31:05,983 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-01-31 14:31:05,984 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:31:05,985 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-31 14:31:05,986 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:05 BoogieIcfgContainer [2019-01-31 14:31:05,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:05,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:05,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:05,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:05,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:05" (1/2) ... [2019-01-31 14:31:05,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4f8457 and model type matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:05, skipping insertion in model container [2019-01-31 14:31:05,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:05" (2/2) ... [2019-01-31 14:31:05,994 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix.i_4.bpl [2019-01-31 14:31:06,002 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:06,010 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:06,022 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:06,052 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:06,052 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:06,053 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:06,053 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:06,053 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:06,053 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:06,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:06,053 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-01-31 14:31:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:06,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:06,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:06,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:06,086 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-31 14:31:06,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:06,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:06,449 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-01-31 14:31:06,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9#false} is VALID [2019-01-31 14:31:06,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} assume !false; {9#false} is VALID [2019-01-31 14:31:06,459 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-31 14:31:06,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:06,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:06,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:06,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:06,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:06,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:06,515 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-31 14:31:06,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:06,528 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-01-31 14:31:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:06,656 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-31 14:31:06,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:06,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-31 14:31:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-31 14:31:06,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-01-31 14:31:06,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:06,726 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:06,727 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 14:31:06,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 14:31:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-31 14:31:06,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:06,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 6 states. [2019-01-31 14:31:06,850 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 6 states. [2019-01-31 14:31:06,850 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 6 states. [2019-01-31 14:31:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:06,854 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-01-31 14:31:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-31 14:31:06,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:06,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:06,855 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states. [2019-01-31 14:31:06,855 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states. [2019-01-31 14:31:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:06,857 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-01-31 14:31:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-31 14:31:06,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:06,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:06,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:06,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-31 14:31:06,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-01-31 14:31:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:06,863 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-31 14:31:06,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 14:31:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:06,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:06,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:31:06,864 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:06,865 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-01-31 14:31:06,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:06,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:06,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:06,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:07,268 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-31 14:31:07,520 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-01-31 14:31:07,604 INFO L273 TraceCheckUtils]: 0: Hoare triple {56#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} is VALID [2019-01-31 14:31:07,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} is VALID [2019-01-31 14:31:07,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {57#false} is VALID [2019-01-31 14:31:07,636 INFO L273 TraceCheckUtils]: 3: Hoare triple {57#false} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {57#false} is VALID [2019-01-31 14:31:07,636 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#false} assume !false; {57#false} is VALID [2019-01-31 14:31:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:07,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:07,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 14:31:07,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:07,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:07,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:07,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:07,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:07,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:07,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:07,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:07,708 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-31 14:31:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,041 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-31 14:31:08,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:08,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-31 14:31:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-31 14:31:08,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-01-31 14:31:08,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:08,089 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:08,089 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 14:31:08,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 14:31:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 14:31:08,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:08,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:08,117 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:08,117 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,118 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-31 14:31:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 14:31:08,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:08,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:08,120 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:08,120 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,123 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-31 14:31:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 14:31:08,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:08,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:08,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:08,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-31 14:31:08,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-31 14:31:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:08,128 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-31 14:31:08,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 14:31:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 14:31:08,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:08,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 14:31:08,129 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-01-31 14:31:08,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:08,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:08,654 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2019-01-31 14:31:09,051 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2019-01-31 14:31:09,221 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-01-31 14:31:09,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} is VALID [2019-01-31 14:31:09,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} is VALID [2019-01-31 14:31:09,228 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-01-31 14:31:09,228 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-01-31 14:31:09,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-01-31 14:31:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:09,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:09,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:09,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 14:31:09,233 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2019-01-31 14:31:09,281 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:09,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:09,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:09,508 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 5. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 14:31:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:09,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:09,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:09,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:31:09,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:09,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:09,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 15 treesize of output 10 [2019-01-31 14:31:09,829 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-31 14:31:09,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:09,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:09,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:09,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2019-01-31 14:31:09,860 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:09,860 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~matriz~5_7, ULTIMATE.start_main_~j~5, |v_ULTIMATE.start_main_#t~nondet3_4|]. (let ((.cse0 (mod ULTIMATE.start_main_~j~5 4294967296))) (and (<= (select (select ULTIMATE.start_main_~matriz~5 .cse0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (store v_ULTIMATE.start_main_~matriz~5_7 .cse0 (store (select v_ULTIMATE.start_main_~matriz~5_7 .cse0) 0 |v_ULTIMATE.start_main_#t~nondet3_4|)) ULTIMATE.start_main_~matriz~5) (<= ULTIMATE.start_main_~j~5 0))) [2019-01-31 14:31:09,860 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~j~5]. (and (<= (select (select ULTIMATE.start_main_~matriz~5 (mod ULTIMATE.start_main_~j~5 4294967296)) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0)) [2019-01-31 14:31:10,006 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-01-31 14:31:10,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {121#(and (= ULTIMATE.start_main_~k~5 0) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-01-31 14:31:10,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(and (= ULTIMATE.start_main_~k~5 0) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-01-31 14:31:10,043 INFO L273 TraceCheckUtils]: 3: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-01-31 14:31:10,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-01-31 14:31:10,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-01-31 14:31:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:10,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:10,523 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-31 14:31:10,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-31 14:31:10,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 5 [2019-01-31 14:31:10,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:10,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:10,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-31 14:31:10,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2019-01-31 14:31:10,556 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:10,556 WARN L398 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~matriz~5, |ULTIMATE.start_main_#t~nondet3|]. (< (select (select (let ((.cse0 (mod ULTIMATE.start_main_~j~5 4294967296))) (store ULTIMATE.start_main_~matriz~5 .cse0 (store (select ULTIMATE.start_main_~matriz~5 .cse0) (mod ULTIMATE.start_main_~k~5 4294967296) |ULTIMATE.start_main_#t~nondet3|))) 0) 0) (+ |ULTIMATE.start_main_#t~nondet3| 1)) [2019-01-31 14:31:10,556 WARN L399 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296))) [2019-01-31 14:31:10,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-01-31 14:31:10,608 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-01-31 14:31:10,609 INFO L273 TraceCheckUtils]: 3: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-01-31 14:31:10,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {143#(and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296)))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-01-31 14:31:10,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {147#(= 0 (mod ULTIMATE.start_main_~j~5 4294967296))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {143#(and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-01-31 14:31:10,613 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {147#(= 0 (mod ULTIMATE.start_main_~j~5 4294967296))} is VALID [2019-01-31 14:31:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:10,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-01-31 14:31:10,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:10,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 14:31:10,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:10,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-31 14:31:10,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:10,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 14:31:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 14:31:10,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-31 14:31:10,671 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2019-01-31 14:31:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:10,913 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-31 14:31:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 14:31:10,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 14:31:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-31 14:31:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-31 14:31:10,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2019-01-31 14:31:10,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:10,983 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:10,983 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:10,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-31 14:31:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:10,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:10,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:10,984 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:10,985 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:10,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:10,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:10,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:10,986 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:10,986 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:10,987 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:10,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:10,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:10,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:10,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:10,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-31 14:31:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:10,988 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:10,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 14:31:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:10,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:10,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:11,323 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-31 14:31:11,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2019-01-31 14:31:11,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2019-01-31 14:31:11,337 INFO L444 ceAbstractionStarter]: At program point L59(lines 29 59) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_main_~j~5 4294967296))) (let ((.cse0 (< 0 (+ .cse3 1))) (.cse1 (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0)) (.cse2 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~j~5 0) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) .cse3)) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 .cse1 .cse2)))) [2019-01-31 14:31:11,337 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 47) the Hoare annotation is: false [2019-01-31 14:31:11,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-31 14:31:11,337 INFO L444 ceAbstractionStarter]: At program point L70(lines 46 70) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1))) (.cse2 (div ULTIMATE.start_main_~N_LIN~5 4294967296)) (.cse1 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (= ULTIMATE.start_main_~k~5 0) .cse0 .cse1 (<= ULTIMATE.start_main_~j~5 0) (<= .cse2 (div ULTIMATE.start_main_~k~5 4294967296))) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 (<= .cse2 0) .cse1))) [2019-01-31 14:31:11,339 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 14:31:11,341 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 14:31:11,345 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 14:31:11,352 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:11 BoogieIcfgContainer [2019-01-31 14:31:11,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:11,353 INFO L168 Benchmark]: Toolchain (without parser) took 6005.65 ms. Allocated memory was 134.7 MB in the beginning and 219.2 MB in the end (delta: 84.4 MB). Free memory was 109.8 MB in the beginning and 124.7 MB in the end (delta: -14.9 MB). Peak memory consumption was 69.5 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:11,355 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:11,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.86 ms. Allocated memory is still 134.7 MB. Free memory was 109.5 MB in the beginning and 108.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:11,356 INFO L168 Benchmark]: Boogie Preprocessor took 25.12 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:11,357 INFO L168 Benchmark]: RCFGBuilder took 569.76 ms. Allocated memory is still 134.7 MB. Free memory was 106.9 MB in the beginning and 94.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:11,358 INFO L168 Benchmark]: TraceAbstraction took 5365.58 ms. Allocated memory was 134.7 MB in the beginning and 219.2 MB in the end (delta: 84.4 MB). Free memory was 93.8 MB in the beginning and 124.7 MB in the end (delta: -30.8 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:11,362 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.20 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.86 ms. Allocated memory is still 134.7 MB. Free memory was 109.5 MB in the beginning and 108.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.12 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 569.76 ms. Allocated memory is still 134.7 MB. Free memory was 106.9 MB in the beginning and 94.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5365.58 ms. Allocated memory was 134.7 MB in the beginning and 219.2 MB in the end (delta: 84.4 MB). Free memory was 93.8 MB in the beginning and 124.7 MB in the end (delta: -30.8 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((main_~j~5 + 1 <= main_~N_COL~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_COL~5 / 4294967296 <= main_~j~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((main_~k~5 == 0 && 0 < main_~j~5 / 4294967296 + 1) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_LIN~5 / 4294967296 <= main_~k~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 9 SDslu, 3 SDs, 0 SdLazy, 29 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 9 NumberOfFragments, 104 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 7 NumberOfNonLiveVariables, 35 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...