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/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:18:54,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:18:54,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:18:54,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:18:54,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:18:54,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:18:54,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:18:54,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:18:54,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:18:54,138 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:18:54,139 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:18:54,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:18:54,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:18:54,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:18:54,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:18:54,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:18:54,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:18:54,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:18:54,151 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:18:54,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:18:54,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:18:54,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:18:54,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:18:54,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:18:54,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:18:54,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:18:54,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:18:54,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:18:54,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:18:54,164 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:18:54,164 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:18:54,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:18:54,165 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:18:54,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:18:54,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:18:54,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:18:54,167 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-02-14 16:18:54,181 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:18:54,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:18:54,182 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:18:54,182 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:18:54,182 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:18:54,182 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:18:54,183 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-14 16:18:54,184 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-14 16:18:54,184 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:18:54,184 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:18:54,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:18:54,185 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:18:54,185 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:18:54,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:18:54,186 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:18:54,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:18:54,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:18:54,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:18:54,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:18:54,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:18:54,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:18:54,187 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:18:54,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:18:54,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:18:54,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:18:54,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:18:54,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:18:54,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:18:54,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:18:54,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:18:54,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:18:54,189 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:18:54,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:18:54,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:18:54,190 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:18:54,190 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:18:54,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:18:54,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:18:54,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:18:54,245 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:18:54,246 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:18:54,248 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2019-02-14 16:18:54,248 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-02-14 16:18:54,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:18:54,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:18:54,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:18:54,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:18:54,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:18:54,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:18:54,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:18:54,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:18:54,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:18:54,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:18:54,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:18:54,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:18:54,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:18:54,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (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-02-14 16:18:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:18:54,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:18:55,113 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:18:55,114 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-14 16:18:55,115 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:18:55 BoogieIcfgContainer [2019-02-14 16:18:55,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:18:55,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:18:55,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:18:55,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:18:55,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/2) ... [2019-02-14 16:18:55,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348182df and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:18:55, skipping insertion in model container [2019-02-14 16:18:55,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:18:55" (2/2) ... [2019-02-14 16:18:55,124 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-02-14 16:18:55,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:18:55,143 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:18:55,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:18:55,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:18:55,194 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:18:55,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:18:55,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:18:55,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:18:55,195 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:18:55,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:18:55,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:18:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-14 16:18:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:18:55,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:18:55,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:18:55,221 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:18:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-02-14 16:18:55,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:18:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:55,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:18:55,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:55,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:18:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:18:55,603 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~post0, main_#t~post2, main_#t~post1, main_#t~post3, main_#t~post4, main_~nodecount~4, main_~edgecount~4, main_~source~4, main_~Source~4, main_~Dest~4, main_~Weight~4, main_~distance~4, main_~x~4, main_~y~4, main_~i~4, main_~j~4;main_~nodecount~4 := 5;main_~edgecount~4 := 20;main_~source~4 := 0;main_~Source~4 := main_~Source~4[0 := 0];main_~Source~4 := main_~Source~4[1 := 4];main_~Source~4 := main_~Source~4[2 := 1];main_~Source~4 := main_~Source~4[3 := 1];main_~Source~4 := main_~Source~4[4 := 0];main_~Source~4 := main_~Source~4[5 := 0];main_~Source~4 := main_~Source~4[6 := 1];main_~Source~4 := main_~Source~4[7 := 3];main_~Source~4 := main_~Source~4[8 := 4];main_~Source~4 := main_~Source~4[9 := 4];main_~Source~4 := main_~Source~4[10 := 2];main_~Source~4 := main_~Source~4[11 := 2];main_~Source~4 := main_~Source~4[12 := 3];main_~Source~4 := main_~Source~4[13 := 0];main_~Source~4 := main_~Source~4[14 := 0];main_~Source~4 := main_~Source~4[15 := 3];main_~Source~4 := main_~Source~4[16 := 1];main_~Source~4 := main_~Source~4[17 := 2];main_~Source~4 := main_~Source~4[18 := 2];main_~Source~4 := main_~Source~4[19 := 3];main_~Dest~4 := main_~Dest~4[0 := 1];main_~Dest~4 := main_~Dest~4[1 := 3];main_~Dest~4 := main_~Dest~4[2 := 4];main_~Dest~4 := main_~Dest~4[3 := 1];main_~Dest~4 := main_~Dest~4[4 := 1];main_~Dest~4 := main_~Dest~4[5 := 4];main_~Dest~4 := main_~Dest~4[6 := 3];main_~Dest~4 := main_~Dest~4[7 := 4];main_~Dest~4 := main_~Dest~4[8 := 3];main_~Dest~4 := main_~Dest~4[9 := 0];main_~Dest~4 := main_~Dest~4[10 := 0];main_~Dest~4 := main_~Dest~4[11 := 0];main_~Dest~4 := main_~Dest~4[12 := 0];main_~Dest~4 := main_~Dest~4[13 := 2];main_~Dest~4 := main_~Dest~4[14 := 3];main_~Dest~4 := main_~Dest~4[15 := 0];main_~Dest~4 := main_~Dest~4[16 := 2];main_~Dest~4 := main_~Dest~4[17 := 1];main_~Dest~4 := main_~Dest~4[18 := 0];main_~Dest~4 := main_~Dest~4[19 := 4];main_~Weight~4 := main_~Weight~4[0 := 0];main_~Weight~4 := main_~Weight~4[1 := 1];main_~Weight~4 := main_~Weight~4[2 := 2];main_~Weight~4 := main_~Weight~4[3 := 3];main_~Weight~4 := main_~Weight~4[4 := 4];main_~Weight~4 := main_~Weight~4[5 := 5];main_~Weight~4 := main_~Weight~4[6 := 6];main_~Weight~4 := main_~Weight~4[7 := 7];main_~Weight~4 := main_~Weight~4[8 := 8];main_~Weight~4 := main_~Weight~4[9 := 9];main_~Weight~4 := main_~Weight~4[10 := 10];main_~Weight~4 := main_~Weight~4[11 := 11];main_~Weight~4 := main_~Weight~4[12 := 12];main_~Weight~4 := main_~Weight~4[13 := 13];main_~Weight~4 := main_~Weight~4[14 := 14];main_~Weight~4 := main_~Weight~4[15 := 15];main_~Weight~4 := main_~Weight~4[16 := 16];main_~Weight~4 := main_~Weight~4[17 := 17];main_~Weight~4 := main_~Weight~4[18 := 18];main_~Weight~4 := main_~Weight~4[19 := 19];havoc main_~distance~4;havoc main_~x~4;havoc main_~y~4;havoc main_~i~4;havoc main_~j~4;main_~i~4 := 0; {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2019-02-14 16:18:55,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2019-02-14 16:18:55,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {15#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} is VALID [2019-02-14 16:18:55,624 INFO L273 TraceCheckUtils]: 3: Hoare triple {15#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} assume !(main_~i~4 < main_~edgecount~4);main_~i~4 := 0;assume !!(main_~i~4 < main_~nodecount~4);__VERIFIER_assert_#in~cond := (if main_~distance~4[main_~i~4] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {13#false} is VALID [2019-02-14 16:18:55,625 INFO L273 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2019-02-14 16:18:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:18:55,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:18:55,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-14 16:18:55,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:18:55,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:18:55,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:18:55,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:18:55,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:18:55,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:18:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:18:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:18:55,684 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-02-14 16:18:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:56,178 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-02-14 16:18:56,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:18:56,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:18:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:18:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:18:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-02-14 16:18:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:18:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-02-14 16:18:56,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2019-02-14 16:18:56,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:18:56,320 INFO L225 Difference]: With dead ends: 15 [2019-02-14 16:18:56,320 INFO L226 Difference]: Without dead ends: 11 [2019-02-14 16:18:56,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:18:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-14 16:18:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-02-14 16:18:56,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:18:56,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 8 states. [2019-02-14 16:18:56,465 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 8 states. [2019-02-14 16:18:56,466 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 8 states. [2019-02-14 16:18:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:56,468 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-14 16:18:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2019-02-14 16:18:56,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:56,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:56,469 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 11 states. [2019-02-14 16:18:56,470 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 11 states. [2019-02-14 16:18:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:56,471 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-14 16:18:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2019-02-14 16:18:56,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:56,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:56,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:18:56,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:18:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:18:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-14 16:18:56,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-02-14 16:18:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:18:56,476 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-02-14 16:18:56,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:18:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-02-14 16:18:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-14 16:18:56,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:18:56,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-14 16:18:56,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:18:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-02-14 16:18:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:18:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:56,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:18:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:56,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:18:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:18:56,776 INFO L273 TraceCheckUtils]: 0: Hoare triple {79#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~post0, main_#t~post2, main_#t~post1, main_#t~post3, main_#t~post4, main_~nodecount~4, main_~edgecount~4, main_~source~4, main_~Source~4, main_~Dest~4, main_~Weight~4, main_~distance~4, main_~x~4, main_~y~4, main_~i~4, main_~j~4;main_~nodecount~4 := 5;main_~edgecount~4 := 20;main_~source~4 := 0;main_~Source~4 := main_~Source~4[0 := 0];main_~Source~4 := main_~Source~4[1 := 4];main_~Source~4 := main_~Source~4[2 := 1];main_~Source~4 := main_~Source~4[3 := 1];main_~Source~4 := main_~Source~4[4 := 0];main_~Source~4 := main_~Source~4[5 := 0];main_~Source~4 := main_~Source~4[6 := 1];main_~Source~4 := main_~Source~4[7 := 3];main_~Source~4 := main_~Source~4[8 := 4];main_~Source~4 := main_~Source~4[9 := 4];main_~Source~4 := main_~Source~4[10 := 2];main_~Source~4 := main_~Source~4[11 := 2];main_~Source~4 := main_~Source~4[12 := 3];main_~Source~4 := main_~Source~4[13 := 0];main_~Source~4 := main_~Source~4[14 := 0];main_~Source~4 := main_~Source~4[15 := 3];main_~Source~4 := main_~Source~4[16 := 1];main_~Source~4 := main_~Source~4[17 := 2];main_~Source~4 := main_~Source~4[18 := 2];main_~Source~4 := main_~Source~4[19 := 3];main_~Dest~4 := main_~Dest~4[0 := 1];main_~Dest~4 := main_~Dest~4[1 := 3];main_~Dest~4 := main_~Dest~4[2 := 4];main_~Dest~4 := main_~Dest~4[3 := 1];main_~Dest~4 := main_~Dest~4[4 := 1];main_~Dest~4 := main_~Dest~4[5 := 4];main_~Dest~4 := main_~Dest~4[6 := 3];main_~Dest~4 := main_~Dest~4[7 := 4];main_~Dest~4 := main_~Dest~4[8 := 3];main_~Dest~4 := main_~Dest~4[9 := 0];main_~Dest~4 := main_~Dest~4[10 := 0];main_~Dest~4 := main_~Dest~4[11 := 0];main_~Dest~4 := main_~Dest~4[12 := 0];main_~Dest~4 := main_~Dest~4[13 := 2];main_~Dest~4 := main_~Dest~4[14 := 3];main_~Dest~4 := main_~Dest~4[15 := 0];main_~Dest~4 := main_~Dest~4[16 := 2];main_~Dest~4 := main_~Dest~4[17 := 1];main_~Dest~4 := main_~Dest~4[18 := 0];main_~Dest~4 := main_~Dest~4[19 := 4];main_~Weight~4 := main_~Weight~4[0 := 0];main_~Weight~4 := main_~Weight~4[1 := 1];main_~Weight~4 := main_~Weight~4[2 := 2];main_~Weight~4 := main_~Weight~4[3 := 3];main_~Weight~4 := main_~Weight~4[4 := 4];main_~Weight~4 := main_~Weight~4[5 := 5];main_~Weight~4 := main_~Weight~4[6 := 6];main_~Weight~4 := main_~Weight~4[7 := 7];main_~Weight~4 := main_~Weight~4[8 := 8];main_~Weight~4 := main_~Weight~4[9 := 9];main_~Weight~4 := main_~Weight~4[10 := 10];main_~Weight~4 := main_~Weight~4[11 := 11];main_~Weight~4 := main_~Weight~4[12 := 12];main_~Weight~4 := main_~Weight~4[13 := 13];main_~Weight~4 := main_~Weight~4[14 := 14];main_~Weight~4 := main_~Weight~4[15 := 15];main_~Weight~4 := main_~Weight~4[16 := 16];main_~Weight~4 := main_~Weight~4[17 := 17];main_~Weight~4 := main_~Weight~4[18 := 18];main_~Weight~4 := main_~Weight~4[19 := 19];havoc main_~distance~4;havoc main_~x~4;havoc main_~y~4;havoc main_~i~4;havoc main_~j~4;main_~i~4 := 0; {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2019-02-14 16:18:56,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2019-02-14 16:18:56,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {82#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} is VALID [2019-02-14 16:18:56,782 INFO L273 TraceCheckUtils]: 3: Hoare triple {82#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} assume !!(main_~i~4 < main_~edgecount~4);main_~x~4 := main_~Dest~4[main_~i~4];main_~y~4 := main_~Source~4[main_~i~4];assume !(main_~distance~4[main_~x~4] > main_~distance~4[main_~y~4] + main_~Weight~4[main_~i~4]);main_#t~post3 := main_~i~4;main_~i~4 := main_#t~post3 + 1;havoc main_#t~post3; {83#(<= (+ ULTIMATE.start_main_~i~4 19) ULTIMATE.start_main_~edgecount~4)} is VALID [2019-02-14 16:18:56,788 INFO L273 TraceCheckUtils]: 4: Hoare triple {83#(<= (+ ULTIMATE.start_main_~i~4 19) ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~edgecount~4);main_~i~4 := 0;assume !!(main_~i~4 < main_~nodecount~4);__VERIFIER_assert_#in~cond := (if main_~distance~4[main_~i~4] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {80#false} is VALID [2019-02-14 16:18:56,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {80#false} assume !false; {80#false} is VALID [2019-02-14 16:18:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:18:56,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:18:56,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:18:56,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-14 16:18:56,792 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-02-14 16:18:56,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:18:56,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:18:56,933 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-14 16:18:56,934 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 131 root evaluator evaluations with a maximum evaluation depth of 3. Performed 131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 0 variables. [2019-02-14 16:18:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:56,940 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-14 16:18:57,094 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-14 16:18:57,211 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-14 16:18:57,251 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-14 16:18:57,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-14 16:18:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-02-14 16:18:57,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:18:57,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-02-14 16:18:57,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:18:57,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:18:57,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:18:57,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:18:57,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:18:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:18:57,282 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-02-14 16:18:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:57,338 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2019-02-14 16:18:57,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:18:57,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-02-14 16:18:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:18:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:18:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-02-14 16:18:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:18:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-02-14 16:18:57,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2019-02-14 16:18:57,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:18:57,405 INFO L225 Difference]: With dead ends: 9 [2019-02-14 16:18:57,405 INFO L226 Difference]: Without dead ends: 0 [2019-02-14 16:18:57,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-14 16:18:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-14 16:18:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-14 16:18:57,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:18:57,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-14 16:18:57,407 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:18:57,408 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:18:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:57,408 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:18:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:18:57,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:57,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:57,409 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:18:57,409 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:18:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:57,409 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:18:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:18:57,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:57,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:57,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:18:57,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:18:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-14 16:18:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-14 16:18:57,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-14 16:18:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:18:57,411 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-14 16:18:57,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:18:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:18:57,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:57,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-14 16:18:57,621 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 176) no Hoare annotation was computed. [2019-02-14 16:18:57,621 INFO L444 ceAbstractionStarter]: At program point L155(lines 155 174) the Hoare annotation is: false [2019-02-14 16:18:57,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 175) no Hoare annotation was computed. [2019-02-14 16:18:57,622 INFO L444 ceAbstractionStarter]: At program point L114(lines 97 114) the Hoare annotation is: (and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~source~4 0) (= ~INFINITY 899) (= ULTIMATE.start_main_~i~4 0)) [2019-02-14 16:18:57,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 176) no Hoare annotation was computed. [2019-02-14 16:18:57,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 176) no Hoare annotation was computed. [2019-02-14 16:18:57,622 INFO L444 ceAbstractionStarter]: At program point L144(lines 123 145) the Hoare annotation is: false [2019-02-14 16:18:57,622 INFO L444 ceAbstractionStarter]: At program point L173(lines 127 173) the Hoare annotation is: false [2019-02-14 16:18:57,623 INFO L444 ceAbstractionStarter]: At program point L163(lines 106 163) the Hoare annotation is: false [2019-02-14 16:18:57,624 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-14 16:18:57,632 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-14 16:18:57,632 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-14 16:18:57,632 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-14 16:18:57,632 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-14 16:18:57,639 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 04:18:57 BoogieIcfgContainer [2019-02-14 16:18:57,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-14 16:18:57,640 INFO L168 Benchmark]: Toolchain (without parser) took 3321.07 ms. Allocated memory was 130.0 MB in the beginning and 208.7 MB in the end (delta: 78.6 MB). Free memory was 102.0 MB in the beginning and 190.7 MB in the end (delta: -88.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:18:57,643 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 130.0 MB. Free memory is still 103.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:18:57,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.86 ms. Allocated memory is still 130.0 MB. Free memory was 102.0 MB in the beginning and 100.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-14 16:18:57,644 INFO L168 Benchmark]: Boogie Preprocessor took 38.92 ms. Allocated memory is still 130.0 MB. Free memory was 100.3 MB in the beginning and 99.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-14 16:18:57,645 INFO L168 Benchmark]: RCFGBuilder took 711.89 ms. Allocated memory is still 130.0 MB. Free memory was 99.0 MB in the beginning and 81.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-02-14 16:18:57,647 INFO L168 Benchmark]: TraceAbstraction took 2521.62 ms. Allocated memory was 130.0 MB in the beginning and 208.7 MB in the end (delta: 78.6 MB). Free memory was 80.9 MB in the beginning and 190.7 MB in the end (delta: -109.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:18:57,651 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.22 ms. Allocated memory is still 130.0 MB. Free memory is still 103.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.86 ms. Allocated memory is still 130.0 MB. Free memory was 102.0 MB in the beginning and 100.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.92 ms. Allocated memory is still 130.0 MB. Free memory was 100.3 MB in the beginning and 99.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 711.89 ms. Allocated memory is still 130.0 MB. Free memory was 99.0 MB in the beginning and 81.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2521.62 ms. Allocated memory was 130.0 MB in the beginning and 208.7 MB in the end (delta: 78.6 MB). Free memory was 80.9 MB in the beginning and 190.7 MB in the end (delta: -109.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 123]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((main_~edgecount~4 == 20 && main_~nodecount~4 == 5) && main_~source~4 == 0) && ~INFINITY == 899) && main_~i~4 == 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 13 SDslu, 0 SDs, 0 SdLazy, 13 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 6 NumberOfFragments, 20 HoareAnnotationTreeSize, 5 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...