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-fa1c628-m [2019-01-31 14:30:58,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:30:58,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:30:58,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:30:58,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:30:58,465 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:30:58,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:30:58,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:30:58,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:30:58,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:30:58,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:30:58,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:30:58,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:30:58,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:30:58,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:30:58,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:30:58,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:30:58,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:30:58,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:30:58,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:30:58,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:30:58,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:30:58,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:30:58,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:30:58,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:30:58,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:30:58,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:30:58,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:30:58,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:30:58,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:30:58,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:30:58,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:30:58,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:30:58,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:30:58,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:30:58,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:30:58,503 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:30:58,525 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:30:58,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:30:58,527 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:30:58,527 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:30:58,528 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:30:58,528 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:30:58,528 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:30:58,528 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:30:58,528 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:30:58,529 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:30:58,531 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:30:58,531 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:30:58,532 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:30:58,532 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:30:58,533 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:30:58,533 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:30:58,533 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:30:58,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:30:58,533 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:30:58,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:30:58,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:30:58,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:30:58,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:30:58,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:30:58,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:30:58,536 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:30:58,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:30:58,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:30:58,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:30:58,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:30:58,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:30:58,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:30:58,537 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:30:58,537 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:30:58,537 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:30:58,538 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:30:58,538 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:30:58,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:30:58,538 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:30:58,538 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:30:58,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:30:58,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:30:58,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:30:58,591 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:30:58,592 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:30:58,593 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-01-31 14:30:58,593 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-01-31 14:30:58,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:30:58,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:30:58,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:30:58,685 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:30:58,702 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,716 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:30:58,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:30:58,737 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,737 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,740 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,740 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,752 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,754 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,757 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:30:58,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:30:58,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:30:58,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (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:30:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:30:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:30:59,539 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:30:59,539 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-31 14:30:59,541 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:30:59 BoogieIcfgContainer [2019-01-31 14:30:59,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:30:59,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:30:59,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:30:59,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:30:59,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/2) ... [2019-01-31 14:30:59,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df3caf2 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:30:59, skipping insertion in model container [2019-01-31 14:30:59,547 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 31.01 02:30:59" (2/2) ... [2019-01-31 14:30:59,549 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-01-31 14:30:59,560 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:30:59,568 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:30:59,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:30:59,622 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:30:59,623 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:30:59,623 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:30:59,623 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:30:59,623 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:30:59,624 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:30:59,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:30:59,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:30:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-31 14:30:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:30:59,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:30:59,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:30:59,649 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:30:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:30:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-01-31 14:30:59,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:30:59,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:30:59,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:30:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:30:59,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:30:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:30:59,979 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-01-31 14:30:59,989 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-01-31 14:30:59,998 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-01-31 14:31:00,001 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-01-31 14:31:00,002 INFO L273 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2019-01-31 14:31:00,004 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:00,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:00,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 14:31:00,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:00,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:00,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:00,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:00,066 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:00,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:00,077 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-01-31 14:31:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,551 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-01-31 14:31:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:00,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-31 14:31:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-31 14:31:00,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2019-01-31 14:31:00,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:00,758 INFO L225 Difference]: With dead ends: 15 [2019-01-31 14:31:00,758 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 14:31:00,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 14:31:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-31 14:31:00,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:00,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 8 states. [2019-01-31 14:31:00,875 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 8 states. [2019-01-31 14:31:00,875 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 8 states. [2019-01-31 14:31:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,878 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-31 14:31:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2019-01-31 14:31:00,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:00,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:00,879 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 11 states. [2019-01-31 14:31:00,879 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 11 states. [2019-01-31 14:31:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,882 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-31 14:31:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2019-01-31 14:31:00,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:00,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:00,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:00,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-31 14:31:00,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-01-31 14:31:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:00,889 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-31 14:31:00,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-01-31 14:31:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 14:31:00,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:00,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 14:31:00,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-01-31 14:31:00,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:00,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:00,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:01,070 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-01-31 14:31:01,072 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-01-31 14:31:01,081 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-01-31 14:31:01,084 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-01-31 14:31:01,085 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-01-31 14:31:01,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {80#false} assume !false; {80#false} is VALID [2019-01-31 14:31:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:01,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:01,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:01,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 14:31:01,089 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-01-31 14:31:01,125 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:01,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:01,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 14:31:01,249 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-01-31 14:31:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:01,253 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 14:31:01,431 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 40% of their original sizes. [2019-01-31 14:31:01,465 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 14:31:01,492 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-01-31 14:31:01,524 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 14:31:01,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 14:31:01,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-31 14:31:01,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:01,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-31 14:31:01,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:01,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:01,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:01,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:01,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:01,585 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-01-31 14:31:01,669 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:01,670 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:01,670 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:01,671 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,671 WARN L224 ngHoareTripleChecker]: Pre: {129#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:01,672 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~i~4 < main_~nodecount~4);assume !(main_~i~4 == main_~source~4);main_~distance~4 := main_~distance~4[main_~i~4 := ~INFINITY];main_#t~post0 := main_~i~4;main_~i~4 := main_#t~post0 + 1;havoc main_#t~post0; [2019-01-31 14:31:01,672 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4)) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4 c_~INFINITY))) [2019-01-31 14:31:01,672 WARN L230 ngHoareTripleChecker]: Post: {130#false} [2019-01-31 14:31:01,673 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:01,673 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,673 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:01,683 WARN L270 ngHoareTripleChecker]: Pre: {129#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:01,683 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~i~4 < main_~nodecount~4);assume !(main_~i~4 == main_~source~4);main_~distance~4 := main_~distance~4[main_~i~4 := ~INFINITY];main_#t~post0 := main_~i~4;main_~i~4 := main_#t~post0 + 1;havoc main_#t~post0; [2019-01-31 14:31:01,684 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4)) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4 c_~INFINITY))) [2019-01-31 14:31:01,688 WARN L276 ngHoareTripleChecker]: Post: {130#false} [2019-01-31 14:31:01,688 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,689 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:01,689 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~i~4 = 0; ULTIMATE.start_main_~nodecount~4 = 5; TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~i~4 = 0; ULTIMATE.start_main_~nodecount~4 = 5; TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:01,690 WARN L628 ntHoareTripleChecker]: (and (not (= c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4)) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4 c_~INFINITY))) (assume !!(main_~i~4 < main_~nodecount~4);assume !(main_~i~4 == main_~source~4);main_~distance~4 := main_~distance~4[main_~i~4 := ~INFINITY];main_#t~post0 := main_~i~4;main_~i~4 := main_#t~post0 + 1;havoc main_#t~post0;) [2019-01-31 14:31:01,690 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:01,691 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,752 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:01,753 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:01,753 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:01,754 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,754 WARN L224 ngHoareTripleChecker]: Pre: {139#true} [2019-01-31 14:31:01,754 WARN L228 ngHoareTripleChecker]: Action: assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; [2019-01-31 14:31:01,754 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~i~4_primed 0) (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4))) [2019-01-31 14:31:01,755 WARN L230 ngHoareTripleChecker]: Post: {140#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:01,755 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:01,755 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,756 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:01,781 WARN L270 ngHoareTripleChecker]: Pre: {139#true} [2019-01-31 14:31:01,781 WARN L274 ngHoareTripleChecker]: Action: assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; [2019-01-31 14:31:01,782 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~i~4_primed 0) (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4))) [2019-01-31 14:31:01,838 WARN L276 ngHoareTripleChecker]: Post: {140#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:01,838 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,838 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:01,839 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:01,839 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_main_~i~4_primed 0) (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4))) (assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0;) [2019-01-31 14:31:01,839 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , }} [2019-01-31 14:31:01,839 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,860 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:01,861 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:01,861 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:01,862 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,862 WARN L224 ngHoareTripleChecker]: Pre: {145#true} [2019-01-31 14:31:01,862 WARN L228 ngHoareTripleChecker]: Action: assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; [2019-01-31 14:31:01,862 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4)) (= c_ULTIMATE.start_main_~i~4_primed 0)) [2019-01-31 14:31:01,863 WARN L230 ngHoareTripleChecker]: Post: {146#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:01,863 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:01,863 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,864 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:01,891 WARN L270 ngHoareTripleChecker]: Pre: {145#true} [2019-01-31 14:31:01,891 WARN L274 ngHoareTripleChecker]: Action: assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; [2019-01-31 14:31:01,892 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4)) (= c_ULTIMATE.start_main_~i~4_primed 0)) [2019-01-31 14:31:01,988 WARN L276 ngHoareTripleChecker]: Post: {146#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:01,988 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,988 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:01,989 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:01,989 WARN L628 ntHoareTripleChecker]: (and (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4)) (= c_ULTIMATE.start_main_~i~4_primed 0)) (assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0;) [2019-01-31 14:31:01,989 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , }} [2019-01-31 14:31:01,989 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,015 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:02,015 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:02,015 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:02,016 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,016 WARN L224 ngHoareTripleChecker]: Pre: {149#true} [2019-01-31 14:31:02,016 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~i~4 < main_~nodecount~4);main_~j~4 := 0; [2019-01-31 14:31:02,016 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~j~4_primed 0) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4)) [2019-01-31 14:31:02,016 WARN L230 ngHoareTripleChecker]: Post: {150#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,016 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:02,017 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,017 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:02,018 WARN L270 ngHoareTripleChecker]: Pre: {149#true} [2019-01-31 14:31:02,018 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~i~4 < main_~nodecount~4);main_~j~4 := 0; [2019-01-31 14:31:02,019 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~j~4_primed 0) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4)) [2019-01-31 14:31:02,025 WARN L276 ngHoareTripleChecker]: Post: {150#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,025 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,026 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:02,026 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:02,026 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_main_~j~4_primed 0) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4)) (assume !!(main_~i~4 < main_~nodecount~4);main_~j~4 := 0;) [2019-01-31 14:31:02,027 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , }} [2019-01-31 14:31:02,027 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,140 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:02,140 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:02,140 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:02,140 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,140 WARN L224 ngHoareTripleChecker]: Pre: {155#true} [2019-01-31 14:31:02,141 WARN L228 ngHoareTripleChecker]: Action: 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; [2019-01-31 14:31:02,141 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~y~4_primed (select c_ULTIMATE.start_main_~Source~4 c_ULTIMATE.start_main_~i~4)) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (not (< (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~i~4)) (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed))) (= c_ULTIMATE.start_main_~x~4_primed (select c_ULTIMATE.start_main_~Dest~4 c_ULTIMATE.start_main_~i~4))) [2019-01-31 14:31:02,141 WARN L230 ngHoareTripleChecker]: Post: {156#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,141 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:02,142 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,142 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:02,150 WARN L270 ngHoareTripleChecker]: Pre: {155#true} [2019-01-31 14:31:02,150 WARN L274 ngHoareTripleChecker]: Action: 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; [2019-01-31 14:31:02,150 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~y~4_primed (select c_ULTIMATE.start_main_~Source~4 c_ULTIMATE.start_main_~i~4)) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (not (< (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~i~4)) (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed))) (= c_ULTIMATE.start_main_~x~4_primed (select c_ULTIMATE.start_main_~Dest~4 c_ULTIMATE.start_main_~i~4))) [2019-01-31 14:31:02,155 WARN L276 ngHoareTripleChecker]: Post: {156#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,156 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,156 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:02,157 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:02,157 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_main_~y~4_primed (select c_ULTIMATE.start_main_~Source~4 c_ULTIMATE.start_main_~i~4)) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (not (< (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~i~4)) (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed))) (= c_ULTIMATE.start_main_~x~4_primed (select c_ULTIMATE.start_main_~Dest~4 c_ULTIMATE.start_main_~i~4))) (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;) [2019-01-31 14:31:02,157 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , }} [2019-01-31 14:31:02,158 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,215 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:02,215 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:02,216 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:02,216 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,216 WARN L224 ngHoareTripleChecker]: Pre: {159#true} [2019-01-31 14:31:02,217 WARN L228 ngHoareTripleChecker]: Action: assume !(main_~j~4 < main_~edgecount~4);main_#t~post1 := main_~i~4;main_~i~4 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-31 14:31:02,217 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (not (< c_ULTIMATE.start_main_~j~4 c_ULTIMATE.start_main_~edgecount~4))) [2019-01-31 14:31:02,217 WARN L230 ngHoareTripleChecker]: Post: {160#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,217 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:02,218 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,218 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:02,244 WARN L270 ngHoareTripleChecker]: Pre: {159#true} [2019-01-31 14:31:02,244 WARN L274 ngHoareTripleChecker]: Action: assume !(main_~j~4 < main_~edgecount~4);main_#t~post1 := main_~i~4;main_~i~4 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-31 14:31:02,245 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (not (< c_ULTIMATE.start_main_~j~4 c_ULTIMATE.start_main_~edgecount~4))) [2019-01-31 14:31:02,360 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-31 14:31:02,360 WARN L276 ngHoareTripleChecker]: Post: {160#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,360 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,361 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:02,361 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:02,361 WARN L628 ntHoareTripleChecker]: (and (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (not (< c_ULTIMATE.start_main_~j~4 c_ULTIMATE.start_main_~edgecount~4))) (assume !(main_~j~4 < main_~edgecount~4);main_#t~post1 := main_~i~4;main_~i~4 := main_#t~post1 + 1;havoc main_#t~post1;) [2019-01-31 14:31:02,362 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , }} [2019-01-31 14:31:02,362 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,506 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:02,506 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:02,507 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:02,507 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,507 WARN L224 ngHoareTripleChecker]: Pre: {161#true} [2019-01-31 14:31:02,508 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~j~4 < main_~edgecount~4);main_~x~4 := main_~Dest~4[main_~j~4];main_~y~4 := main_~Source~4[main_~j~4];assume main_~distance~4[main_~x~4] > main_~distance~4[main_~y~4] + main_~Weight~4[main_~j~4];main_~distance~4 := main_~distance~4[main_~x~4 := main_~distance~4[main_~y~4] + main_~Weight~4[main_~j~4]];main_#t~post2 := main_~j~4;main_~j~4 := main_#t~post2 + 1;havoc main_#t~post2; [2019-01-31 14:31:02,508 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~x~4_primed (select c_ULTIMATE.start_main_~Dest~4 c_ULTIMATE.start_main_~j~4)) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~j~4)))) (< c_ULTIMATE.start_main_~j~4 c_ULTIMATE.start_main_~edgecount~4) (= c_ULTIMATE.start_main_~y~4_primed (select c_ULTIMATE.start_main_~Source~4 c_ULTIMATE.start_main_~j~4)) (= (+ c_ULTIMATE.start_main_~j~4 1) c_ULTIMATE.start_main_~j~4_primed) (< (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~j~4)) (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed))) [2019-01-31 14:31:02,508 WARN L230 ngHoareTripleChecker]: Post: {162#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,508 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:02,509 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,509 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:02,534 WARN L270 ngHoareTripleChecker]: Pre: {161#true} [2019-01-31 14:31:02,534 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~j~4 < main_~edgecount~4);main_~x~4 := main_~Dest~4[main_~j~4];main_~y~4 := main_~Source~4[main_~j~4];assume main_~distance~4[main_~x~4] > main_~distance~4[main_~y~4] + main_~Weight~4[main_~j~4];main_~distance~4 := main_~distance~4[main_~x~4 := main_~distance~4[main_~y~4] + main_~Weight~4[main_~j~4]];main_#t~post2 := main_~j~4;main_~j~4 := main_#t~post2 + 1;havoc main_#t~post2; [2019-01-31 14:31:02,534 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_~x~4_primed (select c_ULTIMATE.start_main_~Dest~4 c_ULTIMATE.start_main_~j~4)) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~j~4)))) (< c_ULTIMATE.start_main_~j~4 c_ULTIMATE.start_main_~edgecount~4) (= c_ULTIMATE.start_main_~y~4_primed (select c_ULTIMATE.start_main_~Source~4 c_ULTIMATE.start_main_~j~4)) (= (+ c_ULTIMATE.start_main_~j~4 1) c_ULTIMATE.start_main_~j~4_primed) (< (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~j~4)) (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed))) [2019-01-31 14:31:02,640 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-31 14:31:02,640 WARN L276 ngHoareTripleChecker]: Post: {162#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:02,641 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,641 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:02,641 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:02,641 WARN L628 ntHoareTripleChecker]: (let ((.cse0 (+ (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~y~4_primed) (select c_ULTIMATE.start_main_~Weight~4 c_ULTIMATE.start_main_~j~4)))) (and (= c_ULTIMATE.start_main_~x~4_primed (select c_ULTIMATE.start_main_~Dest~4 c_ULTIMATE.start_main_~j~4)) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed .cse0)) (< c_ULTIMATE.start_main_~j~4 c_ULTIMATE.start_main_~edgecount~4) (= c_ULTIMATE.start_main_~y~4_primed (select c_ULTIMATE.start_main_~Source~4 c_ULTIMATE.start_main_~j~4)) (= (+ c_ULTIMATE.start_main_~j~4 1) c_ULTIMATE.start_main_~j~4_primed) (< .cse0 (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~x~4_primed)))) (assume !!(main_~j~4 < main_~edgecount~4);main_~x~4 := main_~Dest~4[main_~j~4];main_~y~4 := main_~Source~4[main_~j~4];assume main_~distance~4[main_~x~4] > main_~distance~4[main_~y~4] + main_~Weight~4[main_~j~4];main_~distance~4 := main_~distance~4[main_~x~4 := main_~distance~4[main_~y~4] + main_~Weight~4[main_~j~4]];main_#t~post2 := main_~j~4;main_~j~4 := main_#t~post2 + 1;havoc main_#t~post2;) [2019-01-31 14:31:02,641 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , }} [2019-01-31 14:31:02,642 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,278 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:03,279 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:03,279 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:03,279 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:03,279 WARN L224 ngHoareTripleChecker]: Pre: {164#true} [2019-01-31 14:31:03,280 WARN L228 ngHoareTripleChecker]: Action: 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; [2019-01-31 14:31:03,280 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_main_~i~4_primed c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~4_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (<= 0 (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4_primed)) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4))) [2019-01-31 14:31:03,280 WARN L230 ngHoareTripleChecker]: Post: {165#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:03,280 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:03,280 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:03,281 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:03,298 WARN L270 ngHoareTripleChecker]: Pre: {164#true} [2019-01-31 14:31:03,298 WARN L274 ngHoareTripleChecker]: Action: 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; [2019-01-31 14:31:03,299 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_main_~i~4_primed c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~4_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (<= 0 (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4_primed)) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4))) [2019-01-31 14:31:03,318 WARN L276 ngHoareTripleChecker]: Post: {165#(and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (= ULTIMATE.start_main_~i~4 0))} [2019-01-31 14:31:03,318 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,318 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:03,319 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~edgecount~4, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~nodecount~4, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2019-01-31 14:31:03,319 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_main_~i~4_primed c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~4_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (<= 0 (select c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4_primed)) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_main_~i~4 c_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;) [2019-01-31 14:31:03,320 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~nodecount~4 = 5; ULTIMATE.start_main_~i~4 = 0; , }} [2019-01-31 14:31:03,320 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,326 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2019-01-31 14:31:03,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:03,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-31 14:31:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-31 14:31:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-31 14:31:03,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2019-01-31 14:31:03,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:03,363 INFO L225 Difference]: With dead ends: 15 [2019-01-31 14:31:03,363 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 14:31:03,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 14:31:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 14:31:03,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:03,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:03,401 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:03,401 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,402 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-31 14:31:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-31 14:31:03,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:03,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:03,403 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:03,403 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-31 14:31:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,404 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-31 14:31:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-31 14:31:03,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:03,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:03,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:03,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 14:31:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-31 14:31:03,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-01-31 14:31:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:03,406 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-31 14:31:03,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-31 14:31:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 14:31:03,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:03,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:03,407 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1948209421, now seen corresponding path program 1 times [2019-01-31 14:31:03,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:03,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:03,704 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-31 14:31:03,793 INFO L273 TraceCheckUtils]: 0: Hoare triple {205#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; {207#(and (<= ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~source~4) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4))} is VALID [2019-01-31 14:31:03,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#(and (<= ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~source~4) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4))} assume !!(main_~i~4 < main_~nodecount~4);assume !(main_~i~4 == main_~source~4);main_~distance~4 := main_~distance~4[main_~i~4 := ~INFINITY];main_#t~post0 := main_~i~4;main_~i~4 := main_#t~post0 + 1;havoc main_#t~post0; {206#false} is VALID [2019-01-31 14:31:03,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {206#false} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {206#false} is VALID [2019-01-31 14:31:03,795 INFO L273 TraceCheckUtils]: 3: Hoare triple {206#false} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {206#false} is VALID [2019-01-31 14:31:03,795 INFO L273 TraceCheckUtils]: 4: Hoare triple {206#false} 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; {206#false} is VALID [2019-01-31 14:31:03,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {206#false} 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; {206#false} is VALID [2019-01-31 14:31:03,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#false} assume !false; {206#false} is VALID [2019-01-31 14:31:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 14:31:03,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:03,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:03,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:03,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-31 14:31:03,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:03,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:03,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:03,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:03,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:03,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:03,838 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2019-01-31 14:31:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,856 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-31 14:31:03,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:03,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-31 14:31:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 14:31:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 14:31:03,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-31 14:31:03,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:03,873 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:03,873 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:03,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:03,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:03,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:03,875 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:03,875 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:03,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:03,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:03,877 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:03,877 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,877 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:03,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:03,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:03,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:03,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:03,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-31 14:31:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:03,879 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:03,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:03,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:03,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:03,996 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 176) no Hoare annotation was computed. [2019-01-31 14:31:03,996 INFO L444 ceAbstractionStarter]: At program point L155(lines 155 174) the Hoare annotation is: false [2019-01-31 14:31:03,996 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_~i~4 ULTIMATE.start_main_~source~4) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4) (= ULTIMATE.start_main_~i~4 0)) [2019-01-31 14:31:03,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 175) no Hoare annotation was computed. [2019-01-31 14:31:03,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 176) no Hoare annotation was computed. [2019-01-31 14:31:03,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 176) no Hoare annotation was computed. [2019-01-31 14:31:03,997 INFO L444 ceAbstractionStarter]: At program point L144(lines 123 145) the Hoare annotation is: false [2019-01-31 14:31:03,997 INFO L444 ceAbstractionStarter]: At program point L173(lines 127 173) the Hoare annotation is: false [2019-01-31 14:31:03,997 INFO L444 ceAbstractionStarter]: At program point L163(lines 106 163) the Hoare annotation is: false [2019-01-31 14:31:03,998 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 14:31:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 14:31:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:04,018 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:04,018 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-01-31 14:31:04,024 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:04 BoogieIcfgContainer [2019-01-31 14:31:04,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:04,026 INFO L168 Benchmark]: Toolchain (without parser) took 5343.20 ms. Allocated memory was 141.0 MB in the beginning and 221.2 MB in the end (delta: 80.2 MB). Free memory was 106.4 MB in the beginning and 160.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:04,027 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:04,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.51 ms. Allocated memory is still 141.0 MB. Free memory was 106.4 MB in the beginning and 104.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:04,028 INFO L168 Benchmark]: Boogie Preprocessor took 35.51 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:04,029 INFO L168 Benchmark]: RCFGBuilder took 780.02 ms. Allocated memory is still 141.0 MB. Free memory was 103.4 MB in the beginning and 85.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:04,030 INFO L168 Benchmark]: TraceAbstraction took 4482.03 ms. Allocated memory was 141.0 MB in the beginning and 221.2 MB in the end (delta: 80.2 MB). Free memory was 85.2 MB in the beginning and 160.5 MB in the end (delta: -75.4 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:04,035 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 141.0 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.51 ms. Allocated memory is still 141.0 MB. Free memory was 106.4 MB in the beginning and 104.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.51 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.02 ms. Allocated memory is still 141.0 MB. Free memory was 103.4 MB in the beginning and 85.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4482.03 ms. Allocated memory was 141.0 MB in the beginning and 221.2 MB in the end (delta: 80.2 MB). Free memory was 85.2 MB in the beginning and 160.5 MB in the end (delta: -75.4 MB). Peak memory consumption was 4.9 MB. 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_~i~4 <= main_~source~4) && main_~source~4 <= main_~i~4) && 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, 4.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 13 SDslu, 1 SDs, 0 SdLazy, 14 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s 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, 1.0 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 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.7s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...