java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:17:55,763 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:17:55,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:17:55,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:17:55,782 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:17:55,783 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:17:55,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:17:55,786 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:17:55,788 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:17:55,789 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:17:55,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:17:55,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:17:55,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:17:55,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:17:55,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:17:55,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:17:55,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:17:55,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:17:55,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:17:55,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:17:55,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:17:55,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:17:55,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:17:55,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:17:55,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:17:55,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:17:55,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:17:55,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:17:55,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:17:55,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:17:55,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:17:55,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:17:55,821 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:17:55,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:17:55,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:17:55,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:17:55,823 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:17:55,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:17:55,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:17:55,854 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:17:55,854 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:17:55,856 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:17:55,856 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:17:55,856 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:17:55,857 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:17:55,857 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:17:55,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:17:55,857 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:17:55,857 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:17:55,859 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:17:55,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:17:55,859 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:17:55,859 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:17:55,859 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:17:55,860 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:17:55,860 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:17:55,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:17:55,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:17:55,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:17:55,862 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:17:55,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:17:55,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:17:55,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:17:55,863 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:17:55,863 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:17:55,863 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:17:55,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:17:55,863 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:17:55,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:17:55,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:17:55,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:17:55,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:17:55,956 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:17:55,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-14 19:17:56,023 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6583f27/21af6cc776a247089babe30acf3c5df2/FLAGed2d59bc0 [2018-11-14 19:17:56,428 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:17:56,429 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-14 19:17:56,437 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6583f27/21af6cc776a247089babe30acf3c5df2/FLAGed2d59bc0 [2018-11-14 19:17:56,451 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6583f27/21af6cc776a247089babe30acf3c5df2 [2018-11-14 19:17:56,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:17:56,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:17:56,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:56,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:17:56,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:17:56,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f322ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56, skipping insertion in model container [2018-11-14 19:17:56,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:17:56,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:17:56,729 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:56,737 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:17:56,802 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:56,826 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:17:56,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56 WrapperNode [2018-11-14 19:17:56,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:56,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:17:56,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:17:56,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:17:56,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... [2018-11-14 19:17:56,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:17:56,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:17:56,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:17:56,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:17:56,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:17:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:17:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:17:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:17:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:17:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:17:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:17:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:17:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:17:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:17:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:17:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:17:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:17:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:17:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:17:58,344 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:17:58,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:58 BoogieIcfgContainer [2018-11-14 19:17:58,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:17:58,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:17:58,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:17:58,350 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:17:58,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:17:56" (1/3) ... [2018-11-14 19:17:58,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f8d520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:58, skipping insertion in model container [2018-11-14 19:17:58,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:56" (2/3) ... [2018-11-14 19:17:58,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f8d520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:58, skipping insertion in model container [2018-11-14 19:17:58,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:58" (3/3) ... [2018-11-14 19:17:58,354 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-11-14 19:17:58,363 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:17:58,370 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:17:58,383 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:17:58,413 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:17:58,413 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:17:58,414 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:17:58,414 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:17:58,414 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:17:58,414 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:17:58,414 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:17:58,414 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:17:58,414 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:17:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-14 19:17:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:17:58,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:58,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:58,443 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:58,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1090382313, now seen corresponding path program 1 times [2018-11-14 19:17:58,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:58,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:58,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-14 19:17:58,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {43#true} is VALID [2018-11-14 19:17:58,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-14 19:17:58,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2018-11-14 19:17:58,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret18 := main(); {43#true} is VALID [2018-11-14 19:17:58,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {43#true} is VALID [2018-11-14 19:17:58,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-14 19:17:58,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2018-11-14 19:17:58,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 19:17:58,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2018-11-14 19:17:58,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 19:17:58,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2018-11-14 19:17:58,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2018-11-14 19:17:58,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {44#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {44#false} is VALID [2018-11-14 19:17:58,733 INFO L256 TraceCheckUtils]: 14: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {44#false} is VALID [2018-11-14 19:17:58,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2018-11-14 19:17:58,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#false} assume ~cond == 0; {44#false} is VALID [2018-11-14 19:17:58,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-14 19:17:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:58,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:58,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:17:58,746 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 19:17:58,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:58,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:17:58,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:58,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:17:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:17:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:17:58,861 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-14 19:17:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:59,170 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2018-11-14 19:17:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:17:59,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 19:17:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-14 19:17:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-14 19:17:59,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2018-11-14 19:17:59,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:59,463 INFO L225 Difference]: With dead ends: 70 [2018-11-14 19:17:59,463 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 19:17:59,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:17:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 19:17:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 19:17:59,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:59,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 19:17:59,654 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 19:17:59,654 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 19:17:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:59,662 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-14 19:17:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 19:17:59,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:59,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:59,665 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 19:17:59,665 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 19:17:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:59,678 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-14 19:17:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 19:17:59,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:59,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:59,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:59,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:17:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-14 19:17:59,689 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2018-11-14 19:17:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:59,690 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-14 19:17:59,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:17:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 19:17:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:17:59,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:59,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:59,694 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:59,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash -448793496, now seen corresponding path program 1 times [2018-11-14 19:17:59,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:59,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:59,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:00,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-14 19:18:00,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {250#true} is VALID [2018-11-14 19:18:00,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-14 19:18:00,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {250#true} {250#true} #108#return; {250#true} is VALID [2018-11-14 19:18:00,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {250#true} call #t~ret18 := main(); {250#true} is VALID [2018-11-14 19:18:00,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {250#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:00,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:00,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {251#false} is VALID [2018-11-14 19:18:00,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {251#false} ~i~0 := 0; {251#false} is VALID [2018-11-14 19:18:00,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {251#false} assume true; {251#false} is VALID [2018-11-14 19:18:00,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {251#false} assume !(~i~0 < ~nodecount~0); {251#false} is VALID [2018-11-14 19:18:00,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#false} ~i~0 := 0; {251#false} is VALID [2018-11-14 19:18:00,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {251#false} assume true; {251#false} is VALID [2018-11-14 19:18:00,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {251#false} assume !(~i~0 < ~edgecount~0); {251#false} is VALID [2018-11-14 19:18:00,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {251#false} ~i~0 := 0; {251#false} is VALID [2018-11-14 19:18:00,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {251#false} assume true; {251#false} is VALID [2018-11-14 19:18:00,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {251#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {251#false} is VALID [2018-11-14 19:18:00,204 INFO L256 TraceCheckUtils]: 17: Hoare triple {251#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {251#false} is VALID [2018-11-14 19:18:00,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-14 19:18:00,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {251#false} assume ~cond == 0; {251#false} is VALID [2018-11-14 19:18:00,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-14 19:18:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:00,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:00,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:18:00,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 19:18:00,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:00,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:18:00,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:00,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:18:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:18:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:18:00,296 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-11-14 19:18:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:00,519 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-14 19:18:00,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:18:00,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 19:18:00,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:18:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-14 19:18:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:18:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-14 19:18:00,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2018-11-14 19:18:00,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:00,679 INFO L225 Difference]: With dead ends: 64 [2018-11-14 19:18:00,679 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:18:00,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:18:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:18:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-14 19:18:00,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:00,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-14 19:18:00,699 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-14 19:18:00,699 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-14 19:18:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:00,702 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-14 19:18:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-14 19:18:00,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:00,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:00,704 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-14 19:18:00,704 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-14 19:18:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:00,707 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-14 19:18:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-14 19:18:00,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:00,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:00,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:00,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:18:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-14 19:18:00,712 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2018-11-14 19:18:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:00,712 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-14 19:18:00,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:18:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-14 19:18:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 19:18:00,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:00,714 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:00,714 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:00,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1500559425, now seen corresponding path program 1 times [2018-11-14 19:18:00,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:00,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:00,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:00,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2018-11-14 19:18:00,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {464#true} is VALID [2018-11-14 19:18:00,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {464#true} assume true; {464#true} is VALID [2018-11-14 19:18:00,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} #108#return; {464#true} is VALID [2018-11-14 19:18:00,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {464#true} call #t~ret18 := main(); {464#true} is VALID [2018-11-14 19:18:00,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {464#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:00,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:00,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:00,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:00,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {467#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:00,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {467#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:00,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-14 19:18:00,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-14 19:18:00,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-14 19:18:00,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {465#false} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-14 19:18:00,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-14 19:18:00,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-14 19:18:00,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {465#false} assume !(~i~0 < ~edgecount~0); {465#false} is VALID [2018-11-14 19:18:00,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-14 19:18:00,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-14 19:18:00,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {465#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {465#false} is VALID [2018-11-14 19:18:00,921 INFO L256 TraceCheckUtils]: 21: Hoare triple {465#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {465#false} is VALID [2018-11-14 19:18:00,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2018-11-14 19:18:00,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {465#false} assume ~cond == 0; {465#false} is VALID [2018-11-14 19:18:00,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {465#false} assume !false; {465#false} is VALID [2018-11-14 19:18:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:00,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:00,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:00,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:00,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:01,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2018-11-14 19:18:01,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {464#true} is VALID [2018-11-14 19:18:01,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {464#true} assume true; {464#true} is VALID [2018-11-14 19:18:01,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} #108#return; {464#true} is VALID [2018-11-14 19:18:01,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {464#true} call #t~ret18 := main(); {464#true} is VALID [2018-11-14 19:18:01,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {464#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:01,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:01,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:01,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:01,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:01,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume true; {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:01,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-14 19:18:01,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-14 19:18:01,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-14 19:18:01,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {465#false} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-14 19:18:01,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-14 19:18:01,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-14 19:18:01,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {465#false} assume !(~i~0 < ~edgecount~0); {465#false} is VALID [2018-11-14 19:18:01,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-14 19:18:01,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-14 19:18:01,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {465#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {465#false} is VALID [2018-11-14 19:18:01,325 INFO L256 TraceCheckUtils]: 21: Hoare triple {465#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {465#false} is VALID [2018-11-14 19:18:01,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2018-11-14 19:18:01,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {465#false} assume ~cond == 0; {465#false} is VALID [2018-11-14 19:18:01,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {465#false} assume !false; {465#false} is VALID [2018-11-14 19:18:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:01,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:01,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 19:18:01,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 19:18:01,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:01,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:18:01,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:01,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:18:01,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:18:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:18:01,464 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 6 states. [2018-11-14 19:18:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:01,907 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-11-14 19:18:01,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:18:01,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 19:18:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:18:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 19:18:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:18:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 19:18:01,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2018-11-14 19:18:02,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:02,021 INFO L225 Difference]: With dead ends: 68 [2018-11-14 19:18:02,021 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 19:18:02,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:18:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 19:18:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-14 19:18:02,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:02,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-14 19:18:02,061 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-14 19:18:02,061 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-14 19:18:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:02,064 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 19:18:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 19:18:02,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:02,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:02,066 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-14 19:18:02,066 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-14 19:18:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:02,069 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 19:18:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 19:18:02,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:02,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:02,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:02,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 19:18:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-14 19:18:02,073 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 25 [2018-11-14 19:18:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:02,074 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-14 19:18:02,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:18:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-14 19:18:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 19:18:02,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:02,075 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:02,076 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:02,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1094248554, now seen corresponding path program 2 times [2018-11-14 19:18:02,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:02,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:02,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:02,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2018-11-14 19:18:02,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {771#true} is VALID [2018-11-14 19:18:02,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2018-11-14 19:18:02,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #108#return; {771#true} is VALID [2018-11-14 19:18:02,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret18 := main(); {771#true} is VALID [2018-11-14 19:18:02,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {771#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:02,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume true; {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:02,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:02,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:02,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:02,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume true; {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:02,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:02,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {775#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:02,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {775#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {776#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:02,454 INFO L273 TraceCheckUtils]: 14: Hoare triple {776#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {776#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:02,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {776#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {772#false} is VALID [2018-11-14 19:18:02,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-14 19:18:02,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-14 19:18:02,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {772#false} assume !(~i~0 < ~nodecount~0); {772#false} is VALID [2018-11-14 19:18:02,456 INFO L273 TraceCheckUtils]: 19: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-14 19:18:02,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-14 19:18:02,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {772#false} assume !(~i~0 < ~edgecount~0); {772#false} is VALID [2018-11-14 19:18:02,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-14 19:18:02,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-14 19:18:02,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {772#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {772#false} is VALID [2018-11-14 19:18:02,459 INFO L256 TraceCheckUtils]: 25: Hoare triple {772#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {772#false} is VALID [2018-11-14 19:18:02,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2018-11-14 19:18:02,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {772#false} assume ~cond == 0; {772#false} is VALID [2018-11-14 19:18:02,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {772#false} assume !false; {772#false} is VALID [2018-11-14 19:18:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:02,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:02,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:02,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 19:18:02,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:02,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:02,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2018-11-14 19:18:02,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {771#true} is VALID [2018-11-14 19:18:02,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2018-11-14 19:18:02,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #108#return; {771#true} is VALID [2018-11-14 19:18:02,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret18 := main(); {771#true} is VALID [2018-11-14 19:18:02,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {771#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {795#(<= 5 main_~nodecount~0)} assume true; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {795#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {795#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {795#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {795#(<= 5 main_~nodecount~0)} assume true; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {795#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {795#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {795#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {795#(<= 5 main_~nodecount~0)} assume true; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {795#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:02,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {795#(<= 5 main_~nodecount~0)} ~i~0 := 0; {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:02,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:02,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {772#false} is VALID [2018-11-14 19:18:02,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-14 19:18:02,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-14 19:18:02,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {772#false} assume !(~i~0 < ~edgecount~0); {772#false} is VALID [2018-11-14 19:18:02,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-14 19:18:02,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-14 19:18:02,785 INFO L273 TraceCheckUtils]: 24: Hoare triple {772#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {772#false} is VALID [2018-11-14 19:18:02,785 INFO L256 TraceCheckUtils]: 25: Hoare triple {772#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {772#false} is VALID [2018-11-14 19:18:02,786 INFO L273 TraceCheckUtils]: 26: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2018-11-14 19:18:02,786 INFO L273 TraceCheckUtils]: 27: Hoare triple {772#false} assume ~cond == 0; {772#false} is VALID [2018-11-14 19:18:02,787 INFO L273 TraceCheckUtils]: 28: Hoare triple {772#false} assume !false; {772#false} is VALID [2018-11-14 19:18:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 19:18:02,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:18:02,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-14 19:18:02,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-14 19:18:02,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:02,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:18:02,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:02,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:18:02,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:18:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:18:02,870 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2018-11-14 19:18:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:03,751 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-14 19:18:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:18:03,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-14 19:18:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:18:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-14 19:18:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:18:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-14 19:18:03,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-14 19:18:03,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:03,954 INFO L225 Difference]: With dead ends: 112 [2018-11-14 19:18:03,954 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 19:18:03,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:18:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 19:18:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2018-11-14 19:18:04,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:04,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 50 states. [2018-11-14 19:18:04,022 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 50 states. [2018-11-14 19:18:04,022 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 50 states. [2018-11-14 19:18:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:04,028 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-14 19:18:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-14 19:18:04,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:04,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:04,030 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 80 states. [2018-11-14 19:18:04,030 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 80 states. [2018-11-14 19:18:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:04,035 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-14 19:18:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-14 19:18:04,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:04,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:04,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:04,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 19:18:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-14 19:18:04,040 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 29 [2018-11-14 19:18:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:04,040 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-14 19:18:04,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:18:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-14 19:18:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 19:18:04,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:04,042 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:04,042 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:04,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1263413224, now seen corresponding path program 1 times [2018-11-14 19:18:04,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:04,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:04,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:04,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {1239#true} call ULTIMATE.init(); {1239#true} is VALID [2018-11-14 19:18:04,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {1239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1239#true} is VALID [2018-11-14 19:18:04,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {1239#true} assume true; {1239#true} is VALID [2018-11-14 19:18:04,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1239#true} {1239#true} #108#return; {1239#true} is VALID [2018-11-14 19:18:04,202 INFO L256 TraceCheckUtils]: 4: Hoare triple {1239#true} call #t~ret18 := main(); {1239#true} is VALID [2018-11-14 19:18:04,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {1239#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:04,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:04,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:04,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:04,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:04,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:04,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:04,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:04,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:04,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:04,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-14 19:18:04,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,216 INFO L273 TraceCheckUtils]: 20: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-14 19:18:04,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1240#false} is VALID [2018-11-14 19:18:04,217 INFO L273 TraceCheckUtils]: 22: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-14 19:18:04,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1240#false} is VALID [2018-11-14 19:18:04,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,218 INFO L273 TraceCheckUtils]: 28: Hoare triple {1240#false} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-14 19:18:04,218 INFO L273 TraceCheckUtils]: 29: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,219 INFO L273 TraceCheckUtils]: 30: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,219 INFO L273 TraceCheckUtils]: 31: Hoare triple {1240#false} assume !(~i~0 < ~edgecount~0); {1240#false} is VALID [2018-11-14 19:18:04,219 INFO L273 TraceCheckUtils]: 32: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,219 INFO L273 TraceCheckUtils]: 33: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,219 INFO L273 TraceCheckUtils]: 34: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1240#false} is VALID [2018-11-14 19:18:04,220 INFO L256 TraceCheckUtils]: 35: Hoare triple {1240#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1240#false} is VALID [2018-11-14 19:18:04,220 INFO L273 TraceCheckUtils]: 36: Hoare triple {1240#false} ~cond := #in~cond; {1240#false} is VALID [2018-11-14 19:18:04,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {1240#false} assume ~cond == 0; {1240#false} is VALID [2018-11-14 19:18:04,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2018-11-14 19:18:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 19:18:04,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:04,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:04,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:04,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:04,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {1239#true} call ULTIMATE.init(); {1239#true} is VALID [2018-11-14 19:18:04,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {1239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1239#true} is VALID [2018-11-14 19:18:04,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {1239#true} assume true; {1239#true} is VALID [2018-11-14 19:18:04,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1239#true} {1239#true} #108#return; {1239#true} is VALID [2018-11-14 19:18:04,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {1239#true} call #t~ret18 := main(); {1239#true} is VALID [2018-11-14 19:18:04,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {1239#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:04,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:04,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:04,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:04,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:04,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume true; {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:04,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~nodecount~0); {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:04,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:04,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:04,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume true; {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:04,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-14 19:18:04,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-14 19:18:04,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1240#false} is VALID [2018-11-14 19:18:04,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-14 19:18:04,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1240#false} is VALID [2018-11-14 19:18:04,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,622 INFO L273 TraceCheckUtils]: 28: Hoare triple {1240#false} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-14 19:18:04,622 INFO L273 TraceCheckUtils]: 29: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,622 INFO L273 TraceCheckUtils]: 30: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,623 INFO L273 TraceCheckUtils]: 31: Hoare triple {1240#false} assume !(~i~0 < ~edgecount~0); {1240#false} is VALID [2018-11-14 19:18:04,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-14 19:18:04,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-14 19:18:04,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1240#false} is VALID [2018-11-14 19:18:04,624 INFO L256 TraceCheckUtils]: 35: Hoare triple {1240#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1240#false} is VALID [2018-11-14 19:18:04,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {1240#false} ~cond := #in~cond; {1240#false} is VALID [2018-11-14 19:18:04,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {1240#false} assume ~cond == 0; {1240#false} is VALID [2018-11-14 19:18:04,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2018-11-14 19:18:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 19:18:04,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:04,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 19:18:04,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-14 19:18:04,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:04,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:18:04,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:04,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:18:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:18:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:18:04,702 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 8 states. [2018-11-14 19:18:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:05,001 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-11-14 19:18:05,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:18:05,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-14 19:18:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:18:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 19:18:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:18:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 19:18:05,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-14 19:18:05,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:05,290 INFO L225 Difference]: With dead ends: 97 [2018-11-14 19:18:05,290 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 19:18:05,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:18:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 19:18:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-14 19:18:05,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:05,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 54 states. [2018-11-14 19:18:05,353 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 54 states. [2018-11-14 19:18:05,353 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 54 states. [2018-11-14 19:18:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:05,357 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-14 19:18:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-14 19:18:05,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:05,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:05,358 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 63 states. [2018-11-14 19:18:05,358 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 63 states. [2018-11-14 19:18:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:05,361 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-14 19:18:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-14 19:18:05,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:05,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:05,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:05,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 19:18:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-14 19:18:05,365 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 39 [2018-11-14 19:18:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:05,365 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-14 19:18:05,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:18:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-14 19:18:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 19:18:05,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:05,367 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:05,367 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:05,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2099666001, now seen corresponding path program 2 times [2018-11-14 19:18:05,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:05,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:05,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 19:18:05,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1685#true} is VALID [2018-11-14 19:18:05,908 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 19:18:05,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #108#return; {1685#true} is VALID [2018-11-14 19:18:05,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret18 := main(); {1685#true} is VALID [2018-11-14 19:18:05,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:05,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume true; {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:05,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:05,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:05,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:05,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume true; {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:05,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:05,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1689#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:05,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {1689#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:05,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:05,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:05,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:05,925 INFO L273 TraceCheckUtils]: 17: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:05,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:05,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1686#false} is VALID [2018-11-14 19:18:05,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 19:18:05,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:05,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1686#false} is VALID [2018-11-14 19:18:05,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:05,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {1686#false} assume !(~j~0 < ~edgecount~0); {1686#false} is VALID [2018-11-14 19:18:05,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {1686#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1686#false} is VALID [2018-11-14 19:18:05,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:05,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1686#false} is VALID [2018-11-14 19:18:05,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:05,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {1686#false} assume !(~j~0 < ~edgecount~0); {1686#false} is VALID [2018-11-14 19:18:05,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {1686#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1686#false} is VALID [2018-11-14 19:18:05,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:05,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {1686#false} assume !(~i~0 < ~nodecount~0); {1686#false} is VALID [2018-11-14 19:18:05,932 INFO L273 TraceCheckUtils]: 33: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 19:18:05,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:05,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {1686#false} assume !(~i~0 < ~edgecount~0); {1686#false} is VALID [2018-11-14 19:18:05,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 19:18:05,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:05,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1686#false} is VALID [2018-11-14 19:18:05,933 INFO L256 TraceCheckUtils]: 39: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1686#false} is VALID [2018-11-14 19:18:05,933 INFO L273 TraceCheckUtils]: 40: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 19:18:05,933 INFO L273 TraceCheckUtils]: 41: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 19:18:05,934 INFO L273 TraceCheckUtils]: 42: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 19:18:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 19:18:05,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:05,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:05,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:05,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 19:18:05,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:06,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:06,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 19:18:06,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1685#true} is VALID [2018-11-14 19:18:06,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 19:18:06,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #108#return; {1685#true} is VALID [2018-11-14 19:18:06,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret18 := main(); {1685#true} is VALID [2018-11-14 19:18:06,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,242 INFO L273 TraceCheckUtils]: 20: Hoare triple {1710#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,251 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,251 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:06,252 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:06,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume true; {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:06,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1686#false} is VALID [2018-11-14 19:18:06,254 INFO L273 TraceCheckUtils]: 36: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 19:18:06,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 19:18:06,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1686#false} is VALID [2018-11-14 19:18:06,255 INFO L256 TraceCheckUtils]: 39: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1686#false} is VALID [2018-11-14 19:18:06,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 19:18:06,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 19:18:06,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 19:18:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-14 19:18:06,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:18:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-14 19:18:06,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-14 19:18:06,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:06,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:18:06,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:06,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:18:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:18:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:18:06,371 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 9 states. [2018-11-14 19:18:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:07,875 INFO L93 Difference]: Finished difference Result 138 states and 167 transitions. [2018-11-14 19:18:07,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:18:07,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-14 19:18:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:18:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2018-11-14 19:18:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:18:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2018-11-14 19:18:07,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 148 transitions. [2018-11-14 19:18:08,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:08,068 INFO L225 Difference]: With dead ends: 138 [2018-11-14 19:18:08,068 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 19:18:08,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:18:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 19:18:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 63. [2018-11-14 19:18:08,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:08,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 63 states. [2018-11-14 19:18:08,139 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 63 states. [2018-11-14 19:18:08,139 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 63 states. [2018-11-14 19:18:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:08,144 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2018-11-14 19:18:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-11-14 19:18:08,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:08,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:08,145 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 104 states. [2018-11-14 19:18:08,145 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 104 states. [2018-11-14 19:18:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:08,149 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2018-11-14 19:18:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-11-14 19:18:08,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:08,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:08,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:08,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 19:18:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-14 19:18:08,153 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 43 [2018-11-14 19:18:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:08,153 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-14 19:18:08,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:18:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-14 19:18:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 19:18:08,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:08,155 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:08,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:08,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1052406892, now seen corresponding path program 1 times [2018-11-14 19:18:08,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:08,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:08,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:08,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {2299#true} call ULTIMATE.init(); {2299#true} is VALID [2018-11-14 19:18:08,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {2299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2299#true} is VALID [2018-11-14 19:18:08,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {2299#true} assume true; {2299#true} is VALID [2018-11-14 19:18:08,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2299#true} {2299#true} #108#return; {2299#true} is VALID [2018-11-14 19:18:08,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {2299#true} call #t~ret18 := main(); {2299#true} is VALID [2018-11-14 19:18:08,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {2299#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:08,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:08,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:08,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:08,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,841 INFO L273 TraceCheckUtils]: 14: Hoare triple {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:08,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-14 19:18:08,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-14 19:18:08,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-14 19:18:08,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:08,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2300#false} is VALID [2018-11-14 19:18:08,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-14 19:18:08,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:08,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2300#false} is VALID [2018-11-14 19:18:08,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-14 19:18:08,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:08,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2300#false} is VALID [2018-11-14 19:18:08,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {2300#false} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-14 19:18:08,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-14 19:18:08,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {2300#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {2300#false} is VALID [2018-11-14 19:18:08,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {2300#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {2300#false} is VALID [2018-11-14 19:18:08,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {2300#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2300#false} is VALID [2018-11-14 19:18:08,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,853 INFO L273 TraceCheckUtils]: 44: Hoare triple {2300#false} assume !(~i~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:08,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-14 19:18:08,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:08,853 INFO L273 TraceCheckUtils]: 47: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2300#false} is VALID [2018-11-14 19:18:08,854 INFO L256 TraceCheckUtils]: 48: Hoare triple {2300#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2300#false} is VALID [2018-11-14 19:18:08,854 INFO L273 TraceCheckUtils]: 49: Hoare triple {2300#false} ~cond := #in~cond; {2300#false} is VALID [2018-11-14 19:18:08,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {2300#false} assume ~cond == 0; {2300#false} is VALID [2018-11-14 19:18:08,854 INFO L273 TraceCheckUtils]: 51: Hoare triple {2300#false} assume !false; {2300#false} is VALID [2018-11-14 19:18:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 19:18:08,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:08,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:08,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:08,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:09,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {2299#true} call ULTIMATE.init(); {2299#true} is VALID [2018-11-14 19:18:09,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {2299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2299#true} is VALID [2018-11-14 19:18:09,095 INFO L273 TraceCheckUtils]: 2: Hoare triple {2299#true} assume true; {2299#true} is VALID [2018-11-14 19:18:09,095 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2299#true} {2299#true} #108#return; {2299#true} is VALID [2018-11-14 19:18:09,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {2299#true} call #t~ret18 := main(); {2299#true} is VALID [2018-11-14 19:18:09,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {2299#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:09,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:09,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:09,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:09,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:09,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume true; {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:09,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~nodecount~0); {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:09,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:09,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:09,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume true; {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:09,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:09,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:09,108 INFO L273 TraceCheckUtils]: 17: Hoare triple {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:09,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} assume true; {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:09,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-14 19:18:09,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-14 19:18:09,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-14 19:18:09,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:09,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2300#false} is VALID [2018-11-14 19:18:09,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-14 19:18:09,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:09,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2300#false} is VALID [2018-11-14 19:18:09,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-14 19:18:09,114 INFO L273 TraceCheckUtils]: 33: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:09,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2300#false} is VALID [2018-11-14 19:18:09,115 INFO L273 TraceCheckUtils]: 36: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,115 INFO L273 TraceCheckUtils]: 37: Hoare triple {2300#false} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-14 19:18:09,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-14 19:18:09,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,116 INFO L273 TraceCheckUtils]: 40: Hoare triple {2300#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {2300#false} is VALID [2018-11-14 19:18:09,116 INFO L273 TraceCheckUtils]: 41: Hoare triple {2300#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {2300#false} is VALID [2018-11-14 19:18:09,116 INFO L273 TraceCheckUtils]: 42: Hoare triple {2300#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2300#false} is VALID [2018-11-14 19:18:09,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,117 INFO L273 TraceCheckUtils]: 44: Hoare triple {2300#false} assume !(~i~0 < ~edgecount~0); {2300#false} is VALID [2018-11-14 19:18:09,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-14 19:18:09,117 INFO L273 TraceCheckUtils]: 46: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-14 19:18:09,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2300#false} is VALID [2018-11-14 19:18:09,118 INFO L256 TraceCheckUtils]: 48: Hoare triple {2300#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2300#false} is VALID [2018-11-14 19:18:09,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {2300#false} ~cond := #in~cond; {2300#false} is VALID [2018-11-14 19:18:09,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {2300#false} assume ~cond == 0; {2300#false} is VALID [2018-11-14 19:18:09,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {2300#false} assume !false; {2300#false} is VALID [2018-11-14 19:18:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 19:18:09,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:09,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 19:18:09,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-14 19:18:09,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:09,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:18:09,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:09,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:18:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:18:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:18:09,202 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 10 states. [2018-11-14 19:18:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:09,463 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2018-11-14 19:18:09,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:18:09,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-14 19:18:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-14 19:18:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-14 19:18:09,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2018-11-14 19:18:09,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:09,626 INFO L225 Difference]: With dead ends: 132 [2018-11-14 19:18:09,626 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 19:18:09,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:18:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 19:18:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2018-11-14 19:18:09,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:09,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 67 states. [2018-11-14 19:18:09,691 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 67 states. [2018-11-14 19:18:09,691 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 67 states. [2018-11-14 19:18:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:09,695 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-11-14 19:18:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-14 19:18:09,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:09,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:09,696 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 89 states. [2018-11-14 19:18:09,696 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 89 states. [2018-11-14 19:18:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:09,699 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-11-14 19:18:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-14 19:18:09,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:09,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:09,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:09,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 19:18:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-11-14 19:18:09,703 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 52 [2018-11-14 19:18:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:09,704 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-11-14 19:18:09,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:18:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-11-14 19:18:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 19:18:09,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:09,705 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:09,706 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:09,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 10909237, now seen corresponding path program 2 times [2018-11-14 19:18:09,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:09,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:09,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:09,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:10,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2018-11-14 19:18:10,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {2900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2900#true} is VALID [2018-11-14 19:18:10,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2018-11-14 19:18:10,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #108#return; {2900#true} is VALID [2018-11-14 19:18:10,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret18 := main(); {2900#true} is VALID [2018-11-14 19:18:10,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {2900#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:10,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume true; {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:10,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:10,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-14 19:18:10,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:10,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume true; {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:10,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-14 19:18:10,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2904#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:10,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {2904#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,218 INFO L273 TraceCheckUtils]: 18: Hoare triple {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,258 INFO L273 TraceCheckUtils]: 21: Hoare triple {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:10,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-14 19:18:10,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2901#false} is VALID [2018-11-14 19:18:10,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2901#false} is VALID [2018-11-14 19:18:10,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,285 INFO L273 TraceCheckUtils]: 37: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,285 INFO L273 TraceCheckUtils]: 38: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2901#false} is VALID [2018-11-14 19:18:10,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,286 INFO L273 TraceCheckUtils]: 41: Hoare triple {2901#false} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-14 19:18:10,286 INFO L273 TraceCheckUtils]: 42: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,286 INFO L273 TraceCheckUtils]: 43: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {2901#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {2901#false} is VALID [2018-11-14 19:18:10,287 INFO L273 TraceCheckUtils]: 45: Hoare triple {2901#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {2901#false} is VALID [2018-11-14 19:18:10,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {2901#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2901#false} is VALID [2018-11-14 19:18:10,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {2901#false} assume !(~i~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,288 INFO L273 TraceCheckUtils]: 51: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2901#false} is VALID [2018-11-14 19:18:10,289 INFO L256 TraceCheckUtils]: 52: Hoare triple {2901#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2901#false} is VALID [2018-11-14 19:18:10,289 INFO L273 TraceCheckUtils]: 53: Hoare triple {2901#false} ~cond := #in~cond; {2901#false} is VALID [2018-11-14 19:18:10,289 INFO L273 TraceCheckUtils]: 54: Hoare triple {2901#false} assume ~cond == 0; {2901#false} is VALID [2018-11-14 19:18:10,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2018-11-14 19:18:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 19:18:10,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:10,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:10,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:10,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:18:10,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:10,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:10,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2018-11-14 19:18:10,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {2900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2900#true} is VALID [2018-11-14 19:18:10,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2018-11-14 19:18:10,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #108#return; {2900#true} is VALID [2018-11-14 19:18:10,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret18 := main(); {2900#true} is VALID [2018-11-14 19:18:10,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {2900#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-14 19:18:10,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume true; {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-14 19:18:10,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-14 19:18:10,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-14 19:18:10,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-14 19:18:10,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume true; {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-14 19:18:10,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-14 19:18:10,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2901#false} is VALID [2018-11-14 19:18:10,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {2901#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2901#false} is VALID [2018-11-14 19:18:10,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-14 19:18:10,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {2901#false} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2901#false} is VALID [2018-11-14 19:18:10,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {2901#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2901#false} is VALID [2018-11-14 19:18:10,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,781 INFO L273 TraceCheckUtils]: 19: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-14 19:18:10,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {2901#false} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2901#false} is VALID [2018-11-14 19:18:10,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {2901#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2901#false} is VALID [2018-11-14 19:18:10,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {2901#false} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-14 19:18:10,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,782 INFO L273 TraceCheckUtils]: 28: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2901#false} is VALID [2018-11-14 19:18:10,783 INFO L273 TraceCheckUtils]: 30: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,783 INFO L273 TraceCheckUtils]: 31: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,783 INFO L273 TraceCheckUtils]: 32: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,783 INFO L273 TraceCheckUtils]: 33: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,784 INFO L273 TraceCheckUtils]: 34: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2901#false} is VALID [2018-11-14 19:18:10,784 INFO L273 TraceCheckUtils]: 35: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,784 INFO L273 TraceCheckUtils]: 36: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2901#false} is VALID [2018-11-14 19:18:10,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {2901#false} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-14 19:18:10,785 INFO L273 TraceCheckUtils]: 42: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,785 INFO L273 TraceCheckUtils]: 43: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,786 INFO L273 TraceCheckUtils]: 44: Hoare triple {2901#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {2901#false} is VALID [2018-11-14 19:18:10,786 INFO L273 TraceCheckUtils]: 45: Hoare triple {2901#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {2901#false} is VALID [2018-11-14 19:18:10,786 INFO L273 TraceCheckUtils]: 46: Hoare triple {2901#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {2901#false} is VALID [2018-11-14 19:18:10,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,786 INFO L273 TraceCheckUtils]: 48: Hoare triple {2901#false} assume !(~i~0 < ~edgecount~0); {2901#false} is VALID [2018-11-14 19:18:10,787 INFO L273 TraceCheckUtils]: 49: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-14 19:18:10,787 INFO L273 TraceCheckUtils]: 50: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-14 19:18:10,787 INFO L273 TraceCheckUtils]: 51: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2901#false} is VALID [2018-11-14 19:18:10,787 INFO L256 TraceCheckUtils]: 52: Hoare triple {2901#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2901#false} is VALID [2018-11-14 19:18:10,787 INFO L273 TraceCheckUtils]: 53: Hoare triple {2901#false} ~cond := #in~cond; {2901#false} is VALID [2018-11-14 19:18:10,788 INFO L273 TraceCheckUtils]: 54: Hoare triple {2901#false} assume ~cond == 0; {2901#false} is VALID [2018-11-14 19:18:10,788 INFO L273 TraceCheckUtils]: 55: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2018-11-14 19:18:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-14 19:18:10,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:18:10,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-14 19:18:10,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-14 19:18:10,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:10,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:18:10,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:10,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:18:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:18:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:18:10,887 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2018-11-14 19:18:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:11,921 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2018-11-14 19:18:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:18:11,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-14 19:18:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2018-11-14 19:18:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:18:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2018-11-14 19:18:11,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 178 transitions. [2018-11-14 19:18:12,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:12,222 INFO L225 Difference]: With dead ends: 172 [2018-11-14 19:18:12,222 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 19:18:12,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:18:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 19:18:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 74. [2018-11-14 19:18:12,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:12,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 74 states. [2018-11-14 19:18:12,369 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 74 states. [2018-11-14 19:18:12,369 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 74 states. [2018-11-14 19:18:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:12,374 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2018-11-14 19:18:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-11-14 19:18:12,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:12,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:12,375 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 118 states. [2018-11-14 19:18:12,375 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 118 states. [2018-11-14 19:18:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:12,378 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2018-11-14 19:18:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-11-14 19:18:12,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:12,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:12,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:12,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 19:18:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-11-14 19:18:12,381 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 56 [2018-11-14 19:18:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:12,381 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-11-14 19:18:12,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:18:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-14 19:18:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 19:18:12,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:12,382 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:12,382 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:12,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash -724642237, now seen corresponding path program 3 times [2018-11-14 19:18:12,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:12,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:12,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:13,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {3642#true} call ULTIMATE.init(); {3642#true} is VALID [2018-11-14 19:18:13,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {3642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3642#true} is VALID [2018-11-14 19:18:13,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {3642#true} assume true; {3642#true} is VALID [2018-11-14 19:18:13,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3642#true} {3642#true} #108#return; {3642#true} is VALID [2018-11-14 19:18:13,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {3642#true} call #t~ret18 := main(); {3642#true} is VALID [2018-11-14 19:18:13,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {3642#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:13,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:13,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:13,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:13,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,185 INFO L273 TraceCheckUtils]: 21: Hoare triple {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,186 INFO L273 TraceCheckUtils]: 22: Hoare triple {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} assume true; {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-14 19:18:13,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3643#false} is VALID [2018-11-14 19:18:13,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,187 INFO L273 TraceCheckUtils]: 27: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,187 INFO L273 TraceCheckUtils]: 28: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-14 19:18:13,188 INFO L273 TraceCheckUtils]: 29: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3643#false} is VALID [2018-11-14 19:18:13,188 INFO L273 TraceCheckUtils]: 30: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-14 19:18:13,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3643#false} is VALID [2018-11-14 19:18:13,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,189 INFO L273 TraceCheckUtils]: 37: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-14 19:18:13,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3643#false} is VALID [2018-11-14 19:18:13,190 INFO L273 TraceCheckUtils]: 40: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,190 INFO L273 TraceCheckUtils]: 42: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-14 19:18:13,190 INFO L273 TraceCheckUtils]: 44: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3643#false} is VALID [2018-11-14 19:18:13,190 INFO L273 TraceCheckUtils]: 45: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {3643#false} assume !(~i~0 < ~nodecount~0); {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 48: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 49: Hoare triple {3643#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {3643#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 51: Hoare triple {3643#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 52: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {3643#false} assume !(~i~0 < ~edgecount~0); {3643#false} is VALID [2018-11-14 19:18:13,191 INFO L273 TraceCheckUtils]: 54: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,192 INFO L273 TraceCheckUtils]: 55: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,192 INFO L273 TraceCheckUtils]: 56: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3643#false} is VALID [2018-11-14 19:18:13,192 INFO L256 TraceCheckUtils]: 57: Hoare triple {3643#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {3643#false} is VALID [2018-11-14 19:18:13,192 INFO L273 TraceCheckUtils]: 58: Hoare triple {3643#false} ~cond := #in~cond; {3643#false} is VALID [2018-11-14 19:18:13,192 INFO L273 TraceCheckUtils]: 59: Hoare triple {3643#false} assume ~cond == 0; {3643#false} is VALID [2018-11-14 19:18:13,192 INFO L273 TraceCheckUtils]: 60: Hoare triple {3643#false} assume !false; {3643#false} is VALID [2018-11-14 19:18:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 19:18:13,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:13,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:13,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:18:13,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:18:13,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:13,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:13,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {3642#true} call ULTIMATE.init(); {3642#true} is VALID [2018-11-14 19:18:13,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {3642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3642#true} is VALID [2018-11-14 19:18:13,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {3642#true} assume true; {3642#true} is VALID [2018-11-14 19:18:13,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3642#true} {3642#true} #108#return; {3642#true} is VALID [2018-11-14 19:18:13,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {3642#true} call #t~ret18 := main(); {3642#true} is VALID [2018-11-14 19:18:13,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {3642#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {3667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,551 INFO L273 TraceCheckUtils]: 29: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,555 INFO L273 TraceCheckUtils]: 32: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,555 INFO L273 TraceCheckUtils]: 33: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,559 INFO L273 TraceCheckUtils]: 37: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,561 INFO L273 TraceCheckUtils]: 38: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,561 INFO L273 TraceCheckUtils]: 39: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,563 INFO L273 TraceCheckUtils]: 40: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:13,563 INFO L273 TraceCheckUtils]: 41: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:13,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:13,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-14 19:18:13,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3643#false} is VALID [2018-11-14 19:18:13,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,566 INFO L273 TraceCheckUtils]: 46: Hoare triple {3643#false} assume !(~i~0 < ~nodecount~0); {3643#false} is VALID [2018-11-14 19:18:13,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {3643#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {3643#false} is VALID [2018-11-14 19:18:13,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {3643#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {3643#false} is VALID [2018-11-14 19:18:13,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {3643#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {3643#false} is VALID [2018-11-14 19:18:13,567 INFO L273 TraceCheckUtils]: 52: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {3643#false} assume !(~i~0 < ~edgecount~0); {3643#false} is VALID [2018-11-14 19:18:13,567 INFO L273 TraceCheckUtils]: 54: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-14 19:18:13,567 INFO L273 TraceCheckUtils]: 55: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-14 19:18:13,567 INFO L273 TraceCheckUtils]: 56: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3643#false} is VALID [2018-11-14 19:18:13,567 INFO L256 TraceCheckUtils]: 57: Hoare triple {3643#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {3643#false} is VALID [2018-11-14 19:18:13,568 INFO L273 TraceCheckUtils]: 58: Hoare triple {3643#false} ~cond := #in~cond; {3643#false} is VALID [2018-11-14 19:18:13,568 INFO L273 TraceCheckUtils]: 59: Hoare triple {3643#false} assume ~cond == 0; {3643#false} is VALID [2018-11-14 19:18:13,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {3643#false} assume !false; {3643#false} is VALID [2018-11-14 19:18:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-14 19:18:13,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:18:13,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-14 19:18:13,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-14 19:18:13,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:13,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:18:13,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:13,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:18:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:18:13,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:18:13,660 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 9 states. [2018-11-14 19:18:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:14,226 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2018-11-14 19:18:14,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:18:14,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-14 19:18:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:18:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-14 19:18:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:18:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-14 19:18:14,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2018-11-14 19:18:14,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:14,352 INFO L225 Difference]: With dead ends: 144 [2018-11-14 19:18:14,352 INFO L226 Difference]: Without dead ends: 94 [2018-11-14 19:18:14,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:18:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-14 19:18:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-11-14 19:18:15,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:15,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 86 states. [2018-11-14 19:18:15,067 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 86 states. [2018-11-14 19:18:15,068 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 86 states. [2018-11-14 19:18:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:15,072 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-11-14 19:18:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2018-11-14 19:18:15,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:15,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:15,073 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 94 states. [2018-11-14 19:18:15,073 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 94 states. [2018-11-14 19:18:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:15,076 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-11-14 19:18:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2018-11-14 19:18:15,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:15,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:15,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:15,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 19:18:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-11-14 19:18:15,079 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 61 [2018-11-14 19:18:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:15,080 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-11-14 19:18:15,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:18:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-11-14 19:18:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 19:18:15,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:15,081 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:15,081 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:15,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash 373856220, now seen corresponding path program 1 times [2018-11-14 19:18:15,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:15,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:15,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:15,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:15,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:15,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2018-11-14 19:18:15,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {4333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {4333#true} is VALID [2018-11-14 19:18:15,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2018-11-14 19:18:15,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #108#return; {4333#true} is VALID [2018-11-14 19:18:15,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret18 := main(); {4333#true} is VALID [2018-11-14 19:18:15,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {4333#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,344 INFO L273 TraceCheckUtils]: 26: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-14 19:18:15,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {4335#(<= 5 main_~nodecount~0)} ~i~0 := 0; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,347 INFO L273 TraceCheckUtils]: 30: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,347 INFO L273 TraceCheckUtils]: 31: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,350 INFO L273 TraceCheckUtils]: 35: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:15,352 INFO L273 TraceCheckUtils]: 37: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,352 INFO L273 TraceCheckUtils]: 38: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,353 INFO L273 TraceCheckUtils]: 39: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,354 INFO L273 TraceCheckUtils]: 41: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,354 INFO L273 TraceCheckUtils]: 42: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,355 INFO L273 TraceCheckUtils]: 43: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,355 INFO L273 TraceCheckUtils]: 44: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,356 INFO L273 TraceCheckUtils]: 45: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,357 INFO L273 TraceCheckUtils]: 46: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,358 INFO L273 TraceCheckUtils]: 48: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,358 INFO L273 TraceCheckUtils]: 49: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,359 INFO L273 TraceCheckUtils]: 50: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,359 INFO L273 TraceCheckUtils]: 51: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,360 INFO L273 TraceCheckUtils]: 52: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,360 INFO L273 TraceCheckUtils]: 53: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,361 INFO L273 TraceCheckUtils]: 54: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,361 INFO L273 TraceCheckUtils]: 55: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,362 INFO L273 TraceCheckUtils]: 56: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,362 INFO L273 TraceCheckUtils]: 57: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,363 INFO L273 TraceCheckUtils]: 58: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,364 INFO L273 TraceCheckUtils]: 60: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,366 INFO L273 TraceCheckUtils]: 61: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,366 INFO L273 TraceCheckUtils]: 62: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,367 INFO L273 TraceCheckUtils]: 63: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,367 INFO L273 TraceCheckUtils]: 64: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,368 INFO L273 TraceCheckUtils]: 65: Hoare triple {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} assume true; {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-14 19:18:15,368 INFO L273 TraceCheckUtils]: 66: Hoare triple {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {4334#false} is VALID [2018-11-14 19:18:15,368 INFO L273 TraceCheckUtils]: 67: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-14 19:18:15,368 INFO L273 TraceCheckUtils]: 68: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 69: Hoare triple {4334#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 70: Hoare triple {4334#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 71: Hoare triple {4334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 72: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {4334#false} assume !(~i~0 < ~edgecount~0); {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 75: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,369 INFO L273 TraceCheckUtils]: 76: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4334#false} is VALID [2018-11-14 19:18:15,370 INFO L256 TraceCheckUtils]: 77: Hoare triple {4334#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {4334#false} is VALID [2018-11-14 19:18:15,370 INFO L273 TraceCheckUtils]: 78: Hoare triple {4334#false} ~cond := #in~cond; {4334#false} is VALID [2018-11-14 19:18:15,370 INFO L273 TraceCheckUtils]: 79: Hoare triple {4334#false} assume ~cond == 0; {4334#false} is VALID [2018-11-14 19:18:15,370 INFO L273 TraceCheckUtils]: 80: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2018-11-14 19:18:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 19:18:15,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:15,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:15,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:15,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2018-11-14 19:18:15,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {4333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {4333#true} is VALID [2018-11-14 19:18:15,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2018-11-14 19:18:15,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #108#return; {4333#true} is VALID [2018-11-14 19:18:15,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret18 := main(); {4333#true} is VALID [2018-11-14 19:18:15,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {4333#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {4359#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:15,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:15,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:15,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:15,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:15,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:15,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:15,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {4334#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {4334#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {4334#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4334#false} is VALID [2018-11-14 19:18:15,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {4334#false} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-14 19:18:15,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4334#false} is VALID [2018-11-14 19:18:15,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4334#false} is VALID [2018-11-14 19:18:15,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {4334#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4334#false} is VALID [2018-11-14 19:18:15,624 INFO L273 TraceCheckUtils]: 51: Hoare triple {4334#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4334#false} is VALID [2018-11-14 19:18:15,624 INFO L273 TraceCheckUtils]: 52: Hoare triple {4334#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4334#false} is VALID [2018-11-14 19:18:15,625 INFO L273 TraceCheckUtils]: 53: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {4334#false} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-14 19:18:15,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4334#false} is VALID [2018-11-14 19:18:15,625 INFO L273 TraceCheckUtils]: 56: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,625 INFO L273 TraceCheckUtils]: 57: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4334#false} is VALID [2018-11-14 19:18:15,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,626 INFO L273 TraceCheckUtils]: 59: Hoare triple {4334#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4334#false} is VALID [2018-11-14 19:18:15,626 INFO L273 TraceCheckUtils]: 60: Hoare triple {4334#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {4334#false} is VALID [2018-11-14 19:18:15,626 INFO L273 TraceCheckUtils]: 61: Hoare triple {4334#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {4334#false} is VALID [2018-11-14 19:18:15,626 INFO L273 TraceCheckUtils]: 62: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,627 INFO L273 TraceCheckUtils]: 63: Hoare triple {4334#false} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-14 19:18:15,627 INFO L273 TraceCheckUtils]: 64: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4334#false} is VALID [2018-11-14 19:18:15,627 INFO L273 TraceCheckUtils]: 65: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,627 INFO L273 TraceCheckUtils]: 66: Hoare triple {4334#false} assume !(~i~0 < ~nodecount~0); {4334#false} is VALID [2018-11-14 19:18:15,627 INFO L273 TraceCheckUtils]: 67: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-14 19:18:15,627 INFO L273 TraceCheckUtils]: 68: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,628 INFO L273 TraceCheckUtils]: 69: Hoare triple {4334#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {4334#false} is VALID [2018-11-14 19:18:15,628 INFO L273 TraceCheckUtils]: 70: Hoare triple {4334#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {4334#false} is VALID [2018-11-14 19:18:15,628 INFO L273 TraceCheckUtils]: 71: Hoare triple {4334#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {4334#false} is VALID [2018-11-14 19:18:15,628 INFO L273 TraceCheckUtils]: 72: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,628 INFO L273 TraceCheckUtils]: 73: Hoare triple {4334#false} assume !(~i~0 < ~edgecount~0); {4334#false} is VALID [2018-11-14 19:18:15,628 INFO L273 TraceCheckUtils]: 74: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-14 19:18:15,629 INFO L273 TraceCheckUtils]: 75: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-14 19:18:15,629 INFO L273 TraceCheckUtils]: 76: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4334#false} is VALID [2018-11-14 19:18:15,629 INFO L256 TraceCheckUtils]: 77: Hoare triple {4334#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {4334#false} is VALID [2018-11-14 19:18:15,629 INFO L273 TraceCheckUtils]: 78: Hoare triple {4334#false} ~cond := #in~cond; {4334#false} is VALID [2018-11-14 19:18:15,629 INFO L273 TraceCheckUtils]: 79: Hoare triple {4334#false} assume ~cond == 0; {4334#false} is VALID [2018-11-14 19:18:15,630 INFO L273 TraceCheckUtils]: 80: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2018-11-14 19:18:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-14 19:18:15,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:15,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-14 19:18:15,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-11-14 19:18:15,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:15,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:18:15,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:15,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:18:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:18:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:18:15,809 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 11 states. [2018-11-14 19:18:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:17,787 INFO L93 Difference]: Finished difference Result 218 states and 263 transitions. [2018-11-14 19:18:17,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 19:18:17,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-11-14 19:18:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 234 transitions. [2018-11-14 19:18:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 234 transitions. [2018-11-14 19:18:17,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 234 transitions. [2018-11-14 19:18:18,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:18,050 INFO L225 Difference]: With dead ends: 218 [2018-11-14 19:18:18,050 INFO L226 Difference]: Without dead ends: 169 [2018-11-14 19:18:18,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-14 19:18:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-14 19:18:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2018-11-14 19:18:18,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:18,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 115 states. [2018-11-14 19:18:18,934 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 115 states. [2018-11-14 19:18:18,934 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 115 states. [2018-11-14 19:18:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:18,940 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2018-11-14 19:18:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-11-14 19:18:18,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:18,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:18,941 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 169 states. [2018-11-14 19:18:18,941 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 169 states. [2018-11-14 19:18:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:18,945 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2018-11-14 19:18:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-11-14 19:18:18,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:18,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:18,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:18,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 19:18:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2018-11-14 19:18:18,949 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 81 [2018-11-14 19:18:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:18,949 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2018-11-14 19:18:18,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:18:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2018-11-14 19:18:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-14 19:18:18,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:18,951 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:18,951 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:18,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1759457428, now seen corresponding path program 2 times [2018-11-14 19:18:18,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:18,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:18,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:18,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:18,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:19,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {5389#true} call ULTIMATE.init(); {5389#true} is VALID [2018-11-14 19:18:19,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {5389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {5389#true} is VALID [2018-11-14 19:18:19,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5389#true} {5389#true} #108#return; {5389#true} is VALID [2018-11-14 19:18:19,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {5389#true} call #t~ret18 := main(); {5389#true} is VALID [2018-11-14 19:18:19,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {5389#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5389#true} is VALID [2018-11-14 19:18:19,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-14 19:18:19,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {5389#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5389#true} is VALID [2018-11-14 19:18:19,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5389#true} is VALID [2018-11-14 19:18:19,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-14 19:18:19,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5389#true} is VALID [2018-11-14 19:18:19,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5389#true} is VALID [2018-11-14 19:18:19,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-14 19:18:19,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5389#true} is VALID [2018-11-14 19:18:19,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5389#true} is VALID [2018-11-14 19:18:19,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-14 19:18:19,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5389#true} is VALID [2018-11-14 19:18:19,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {5389#true} assume !(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 28: Hoare triple {5389#true} ~i~0 := 0; {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {5389#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 33: Hoare triple {5389#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {5389#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 36: Hoare triple {5389#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 37: Hoare triple {5389#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5389#true} is VALID [2018-11-14 19:18:19,223 INFO L273 TraceCheckUtils]: 38: Hoare triple {5389#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5389#true} is VALID [2018-11-14 19:18:19,224 INFO L273 TraceCheckUtils]: 39: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,224 INFO L273 TraceCheckUtils]: 40: Hoare triple {5389#true} assume !(~j~0 < ~edgecount~0); {5389#true} is VALID [2018-11-14 19:18:19,224 INFO L273 TraceCheckUtils]: 41: Hoare triple {5389#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5389#true} is VALID [2018-11-14 19:18:19,224 INFO L273 TraceCheckUtils]: 42: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5391#(= main_~j~0 0)} is VALID [2018-11-14 19:18:19,225 INFO L273 TraceCheckUtils]: 44: Hoare triple {5391#(= main_~j~0 0)} assume true; {5391#(= main_~j~0 0)} is VALID [2018-11-14 19:18:19,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {5391#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5391#(= main_~j~0 0)} is VALID [2018-11-14 19:18:19,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {5391#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5391#(= main_~j~0 0)} is VALID [2018-11-14 19:18:19,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {5391#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5392#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:19,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {5392#(<= 1 main_~j~0)} assume true; {5392#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:19,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {5392#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,228 INFO L273 TraceCheckUtils]: 52: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,228 INFO L273 TraceCheckUtils]: 53: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,229 INFO L273 TraceCheckUtils]: 54: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,230 INFO L273 TraceCheckUtils]: 56: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,230 INFO L273 TraceCheckUtils]: 57: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,231 INFO L273 TraceCheckUtils]: 58: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,231 INFO L273 TraceCheckUtils]: 59: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,232 INFO L273 TraceCheckUtils]: 60: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,232 INFO L273 TraceCheckUtils]: 61: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,233 INFO L273 TraceCheckUtils]: 62: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,233 INFO L273 TraceCheckUtils]: 63: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,234 INFO L273 TraceCheckUtils]: 64: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,234 INFO L273 TraceCheckUtils]: 65: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,235 INFO L273 TraceCheckUtils]: 66: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,235 INFO L273 TraceCheckUtils]: 67: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,236 INFO L273 TraceCheckUtils]: 68: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,236 INFO L273 TraceCheckUtils]: 69: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,237 INFO L273 TraceCheckUtils]: 70: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,237 INFO L273 TraceCheckUtils]: 71: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,238 INFO L273 TraceCheckUtils]: 72: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,238 INFO L273 TraceCheckUtils]: 73: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,239 INFO L273 TraceCheckUtils]: 74: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,239 INFO L273 TraceCheckUtils]: 75: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,240 INFO L273 TraceCheckUtils]: 76: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,241 INFO L273 TraceCheckUtils]: 78: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,241 INFO L273 TraceCheckUtils]: 79: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,242 INFO L273 TraceCheckUtils]: 80: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,242 INFO L273 TraceCheckUtils]: 81: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,243 INFO L273 TraceCheckUtils]: 82: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,243 INFO L273 TraceCheckUtils]: 83: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,244 INFO L273 TraceCheckUtils]: 84: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,244 INFO L273 TraceCheckUtils]: 85: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,245 INFO L273 TraceCheckUtils]: 86: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,245 INFO L273 TraceCheckUtils]: 87: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,246 INFO L273 TraceCheckUtils]: 88: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,246 INFO L273 TraceCheckUtils]: 89: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,247 INFO L273 TraceCheckUtils]: 90: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,247 INFO L273 TraceCheckUtils]: 91: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,248 INFO L273 TraceCheckUtils]: 92: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,249 INFO L273 TraceCheckUtils]: 93: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,249 INFO L273 TraceCheckUtils]: 94: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,250 INFO L273 TraceCheckUtils]: 95: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,250 INFO L273 TraceCheckUtils]: 96: Hoare triple {5393#(<= 2 main_~edgecount~0)} ~i~0 := 0; {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:19,251 INFO L273 TraceCheckUtils]: 97: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume true; {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:19,252 INFO L273 TraceCheckUtils]: 98: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:19,253 INFO L273 TraceCheckUtils]: 99: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:19,253 INFO L273 TraceCheckUtils]: 100: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2018-11-14 19:18:19,254 INFO L273 TraceCheckUtils]: 101: Hoare triple {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} assume true; {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2018-11-14 19:18:19,255 INFO L273 TraceCheckUtils]: 102: Hoare triple {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {5390#false} is VALID [2018-11-14 19:18:19,255 INFO L273 TraceCheckUtils]: 103: Hoare triple {5390#false} ~i~0 := 0; {5390#false} is VALID [2018-11-14 19:18:19,255 INFO L273 TraceCheckUtils]: 104: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,255 INFO L273 TraceCheckUtils]: 105: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,255 INFO L256 TraceCheckUtils]: 106: Hoare triple {5390#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {5390#false} is VALID [2018-11-14 19:18:19,256 INFO L273 TraceCheckUtils]: 107: Hoare triple {5390#false} ~cond := #in~cond; {5390#false} is VALID [2018-11-14 19:18:19,256 INFO L273 TraceCheckUtils]: 108: Hoare triple {5390#false} assume ~cond == 0; {5390#false} is VALID [2018-11-14 19:18:19,256 INFO L273 TraceCheckUtils]: 109: Hoare triple {5390#false} assume !false; {5390#false} is VALID [2018-11-14 19:18:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 124 proven. 58 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 19:18:19,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:19,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:19,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:18:19,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:19,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:19,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {5389#true} call ULTIMATE.init(); {5389#true} is VALID [2018-11-14 19:18:19,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {5389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {5389#true} is VALID [2018-11-14 19:18:19,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-14 19:18:19,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5389#true} {5389#true} #108#return; {5389#true} is VALID [2018-11-14 19:18:19,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {5389#true} call #t~ret18 := main(); {5389#true} is VALID [2018-11-14 19:18:19,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {5389#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,535 INFO L273 TraceCheckUtils]: 28: Hoare triple {5414#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:19,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:19,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:19,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:19,539 INFO L273 TraceCheckUtils]: 33: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:19,539 INFO L273 TraceCheckUtils]: 34: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:19,540 INFO L273 TraceCheckUtils]: 35: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:19,541 INFO L273 TraceCheckUtils]: 36: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:19,542 INFO L273 TraceCheckUtils]: 37: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:19,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:19,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:19,544 INFO L273 TraceCheckUtils]: 40: Hoare triple {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-14 19:18:19,544 INFO L273 TraceCheckUtils]: 41: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5390#false} is VALID [2018-11-14 19:18:19,544 INFO L273 TraceCheckUtils]: 42: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,544 INFO L273 TraceCheckUtils]: 43: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-14 19:18:19,544 INFO L273 TraceCheckUtils]: 44: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,545 INFO L273 TraceCheckUtils]: 45: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,545 INFO L273 TraceCheckUtils]: 46: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,545 INFO L273 TraceCheckUtils]: 47: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,545 INFO L273 TraceCheckUtils]: 49: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,546 INFO L273 TraceCheckUtils]: 50: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,546 INFO L273 TraceCheckUtils]: 51: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,546 INFO L273 TraceCheckUtils]: 52: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,546 INFO L273 TraceCheckUtils]: 53: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-14 19:18:19,546 INFO L273 TraceCheckUtils]: 54: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5390#false} is VALID [2018-11-14 19:18:19,547 INFO L273 TraceCheckUtils]: 55: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,547 INFO L273 TraceCheckUtils]: 56: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-14 19:18:19,547 INFO L273 TraceCheckUtils]: 57: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,547 INFO L273 TraceCheckUtils]: 58: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,547 INFO L273 TraceCheckUtils]: 59: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,547 INFO L273 TraceCheckUtils]: 60: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,547 INFO L273 TraceCheckUtils]: 61: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 62: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 63: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 64: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 65: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 66: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 67: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 68: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,548 INFO L273 TraceCheckUtils]: 69: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-14 19:18:19,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,549 INFO L273 TraceCheckUtils]: 71: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,549 INFO L273 TraceCheckUtils]: 72: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,549 INFO L273 TraceCheckUtils]: 73: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,549 INFO L273 TraceCheckUtils]: 74: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 76: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 77: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 78: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 79: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 81: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 82: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-14 19:18:19,550 INFO L273 TraceCheckUtils]: 83: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 84: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 85: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 86: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 87: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 88: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 89: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 90: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {5390#false} is VALID [2018-11-14 19:18:19,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 92: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 93: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 94: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 95: Hoare triple {5390#false} assume !(~i~0 < ~nodecount~0); {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 96: Hoare triple {5390#false} ~i~0 := 0; {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 97: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 98: Hoare triple {5390#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 99: Hoare triple {5390#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {5390#false} is VALID [2018-11-14 19:18:19,552 INFO L273 TraceCheckUtils]: 100: Hoare triple {5390#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L273 TraceCheckUtils]: 101: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L273 TraceCheckUtils]: 102: Hoare triple {5390#false} assume !(~i~0 < ~edgecount~0); {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L273 TraceCheckUtils]: 103: Hoare triple {5390#false} ~i~0 := 0; {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L273 TraceCheckUtils]: 104: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L273 TraceCheckUtils]: 105: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L256 TraceCheckUtils]: 106: Hoare triple {5390#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L273 TraceCheckUtils]: 107: Hoare triple {5390#false} ~cond := #in~cond; {5390#false} is VALID [2018-11-14 19:18:19,553 INFO L273 TraceCheckUtils]: 108: Hoare triple {5390#false} assume ~cond == 0; {5390#false} is VALID [2018-11-14 19:18:19,554 INFO L273 TraceCheckUtils]: 109: Hoare triple {5390#false} assume !false; {5390#false} is VALID [2018-11-14 19:18:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 114 proven. 8 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-14 19:18:19,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:19,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-14 19:18:19,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 110 [2018-11-14 19:18:19,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:19,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:18:19,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:19,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:18:19,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:18:19,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:18:19,680 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand 11 states. [2018-11-14 19:18:20,960 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-14 19:18:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:21,669 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2018-11-14 19:18:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 19:18:21,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 110 [2018-11-14 19:18:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 161 transitions. [2018-11-14 19:18:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 161 transitions. [2018-11-14 19:18:21,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 161 transitions. [2018-11-14 19:18:22,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:22,130 INFO L225 Difference]: With dead ends: 233 [2018-11-14 19:18:22,130 INFO L226 Difference]: Without dead ends: 159 [2018-11-14 19:18:22,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-11-14 19:18:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-14 19:18:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2018-11-14 19:18:22,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:22,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 139 states. [2018-11-14 19:18:22,394 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 139 states. [2018-11-14 19:18:22,394 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 139 states. [2018-11-14 19:18:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:22,398 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2018-11-14 19:18:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2018-11-14 19:18:22,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:22,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:22,399 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 159 states. [2018-11-14 19:18:22,400 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 159 states. [2018-11-14 19:18:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:22,404 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2018-11-14 19:18:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2018-11-14 19:18:22,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:22,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:22,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:22,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-14 19:18:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2018-11-14 19:18:22,409 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 110 [2018-11-14 19:18:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:22,409 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2018-11-14 19:18:22,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:18:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2018-11-14 19:18:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-14 19:18:22,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:22,411 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:22,412 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:22,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash 415627454, now seen corresponding path program 3 times [2018-11-14 19:18:22,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:22,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:22,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:23,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2018-11-14 19:18:23,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {6569#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {6569#true} is VALID [2018-11-14 19:18:23,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2018-11-14 19:18:23,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #108#return; {6569#true} is VALID [2018-11-14 19:18:23,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret18 := main(); {6569#true} is VALID [2018-11-14 19:18:23,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {6569#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,011 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,022 INFO L273 TraceCheckUtils]: 27: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,022 INFO L273 TraceCheckUtils]: 28: Hoare triple {6571#(= main_~edgecount~0 20)} ~i~0 := 0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,023 INFO L273 TraceCheckUtils]: 29: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,027 INFO L273 TraceCheckUtils]: 35: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,030 INFO L273 TraceCheckUtils]: 41: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,033 INFO L273 TraceCheckUtils]: 45: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:23,034 INFO L273 TraceCheckUtils]: 47: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,036 INFO L273 TraceCheckUtils]: 49: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,038 INFO L273 TraceCheckUtils]: 51: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,039 INFO L273 TraceCheckUtils]: 52: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,041 INFO L273 TraceCheckUtils]: 54: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,042 INFO L273 TraceCheckUtils]: 55: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,042 INFO L273 TraceCheckUtils]: 56: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,044 INFO L273 TraceCheckUtils]: 58: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,060 INFO L273 TraceCheckUtils]: 59: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,061 INFO L273 TraceCheckUtils]: 60: Hoare triple {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:23,061 INFO L273 TraceCheckUtils]: 61: Hoare triple {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-14 19:18:23,061 INFO L273 TraceCheckUtils]: 62: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6570#false} is VALID [2018-11-14 19:18:23,061 INFO L273 TraceCheckUtils]: 63: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6570#false} is VALID [2018-11-14 19:18:23,062 INFO L273 TraceCheckUtils]: 65: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,062 INFO L273 TraceCheckUtils]: 66: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,062 INFO L273 TraceCheckUtils]: 67: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,062 INFO L273 TraceCheckUtils]: 68: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,062 INFO L273 TraceCheckUtils]: 69: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,063 INFO L273 TraceCheckUtils]: 70: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,063 INFO L273 TraceCheckUtils]: 71: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,063 INFO L273 TraceCheckUtils]: 72: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,063 INFO L273 TraceCheckUtils]: 73: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,063 INFO L273 TraceCheckUtils]: 74: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,063 INFO L273 TraceCheckUtils]: 75: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,063 INFO L273 TraceCheckUtils]: 76: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,064 INFO L273 TraceCheckUtils]: 77: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,064 INFO L273 TraceCheckUtils]: 78: Hoare triple {6570#false} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-14 19:18:23,064 INFO L273 TraceCheckUtils]: 79: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6570#false} is VALID [2018-11-14 19:18:23,064 INFO L273 TraceCheckUtils]: 80: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,064 INFO L273 TraceCheckUtils]: 81: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6570#false} is VALID [2018-11-14 19:18:23,064 INFO L273 TraceCheckUtils]: 82: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,065 INFO L273 TraceCheckUtils]: 83: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,065 INFO L273 TraceCheckUtils]: 84: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,065 INFO L273 TraceCheckUtils]: 85: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,065 INFO L273 TraceCheckUtils]: 86: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,065 INFO L273 TraceCheckUtils]: 87: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,065 INFO L273 TraceCheckUtils]: 88: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,065 INFO L273 TraceCheckUtils]: 89: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,066 INFO L273 TraceCheckUtils]: 90: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,066 INFO L273 TraceCheckUtils]: 91: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,066 INFO L273 TraceCheckUtils]: 92: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,066 INFO L273 TraceCheckUtils]: 93: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,066 INFO L273 TraceCheckUtils]: 94: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,066 INFO L273 TraceCheckUtils]: 95: Hoare triple {6570#false} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-14 19:18:23,067 INFO L273 TraceCheckUtils]: 96: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6570#false} is VALID [2018-11-14 19:18:23,067 INFO L273 TraceCheckUtils]: 97: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,067 INFO L273 TraceCheckUtils]: 98: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6570#false} is VALID [2018-11-14 19:18:23,067 INFO L273 TraceCheckUtils]: 99: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,067 INFO L273 TraceCheckUtils]: 100: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,067 INFO L273 TraceCheckUtils]: 101: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,067 INFO L273 TraceCheckUtils]: 102: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,068 INFO L273 TraceCheckUtils]: 103: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,068 INFO L273 TraceCheckUtils]: 104: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,068 INFO L273 TraceCheckUtils]: 105: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,068 INFO L273 TraceCheckUtils]: 106: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,068 INFO L273 TraceCheckUtils]: 107: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,068 INFO L273 TraceCheckUtils]: 108: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,069 INFO L273 TraceCheckUtils]: 109: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6570#false} is VALID [2018-11-14 19:18:23,069 INFO L273 TraceCheckUtils]: 110: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6570#false} is VALID [2018-11-14 19:18:23,069 INFO L273 TraceCheckUtils]: 111: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,069 INFO L273 TraceCheckUtils]: 112: Hoare triple {6570#false} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-14 19:18:23,069 INFO L273 TraceCheckUtils]: 113: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6570#false} is VALID [2018-11-14 19:18:23,069 INFO L273 TraceCheckUtils]: 114: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,069 INFO L273 TraceCheckUtils]: 115: Hoare triple {6570#false} assume !(~i~0 < ~nodecount~0); {6570#false} is VALID [2018-11-14 19:18:23,070 INFO L273 TraceCheckUtils]: 116: Hoare triple {6570#false} ~i~0 := 0; {6570#false} is VALID [2018-11-14 19:18:23,070 INFO L273 TraceCheckUtils]: 117: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,070 INFO L273 TraceCheckUtils]: 118: Hoare triple {6570#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,070 INFO L273 TraceCheckUtils]: 119: Hoare triple {6570#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {6570#false} is VALID [2018-11-14 19:18:23,070 INFO L273 TraceCheckUtils]: 120: Hoare triple {6570#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6570#false} is VALID [2018-11-14 19:18:23,070 INFO L273 TraceCheckUtils]: 121: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,071 INFO L273 TraceCheckUtils]: 122: Hoare triple {6570#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,071 INFO L273 TraceCheckUtils]: 123: Hoare triple {6570#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {6570#false} is VALID [2018-11-14 19:18:23,071 INFO L273 TraceCheckUtils]: 124: Hoare triple {6570#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6570#false} is VALID [2018-11-14 19:18:23,071 INFO L273 TraceCheckUtils]: 125: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,071 INFO L273 TraceCheckUtils]: 126: Hoare triple {6570#false} assume !(~i~0 < ~edgecount~0); {6570#false} is VALID [2018-11-14 19:18:23,071 INFO L273 TraceCheckUtils]: 127: Hoare triple {6570#false} ~i~0 := 0; {6570#false} is VALID [2018-11-14 19:18:23,071 INFO L273 TraceCheckUtils]: 128: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,072 INFO L273 TraceCheckUtils]: 129: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,072 INFO L256 TraceCheckUtils]: 130: Hoare triple {6570#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {6570#false} is VALID [2018-11-14 19:18:23,072 INFO L273 TraceCheckUtils]: 131: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2018-11-14 19:18:23,072 INFO L273 TraceCheckUtils]: 132: Hoare triple {6570#false} assume ~cond == 0; {6570#false} is VALID [2018-11-14 19:18:23,072 INFO L273 TraceCheckUtils]: 133: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2018-11-14 19:18:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 370 proven. 18 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-14 19:18:23,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:23,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:23,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:18:23,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 19:18:23,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:23,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:23,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2018-11-14 19:18:23,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {6569#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {6569#true} is VALID [2018-11-14 19:18:23,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2018-11-14 19:18:23,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #108#return; {6569#true} is VALID [2018-11-14 19:18:23,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret18 := main(); {6569#true} is VALID [2018-11-14 19:18:23,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {6569#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {6594#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,553 INFO L273 TraceCheckUtils]: 36: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,554 INFO L273 TraceCheckUtils]: 37: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,554 INFO L273 TraceCheckUtils]: 38: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,557 INFO L273 TraceCheckUtils]: 43: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,559 INFO L273 TraceCheckUtils]: 47: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,559 INFO L273 TraceCheckUtils]: 48: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,560 INFO L273 TraceCheckUtils]: 49: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,560 INFO L273 TraceCheckUtils]: 50: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,563 INFO L273 TraceCheckUtils]: 55: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,563 INFO L273 TraceCheckUtils]: 56: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,565 INFO L273 TraceCheckUtils]: 60: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,566 INFO L273 TraceCheckUtils]: 61: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,566 INFO L273 TraceCheckUtils]: 62: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,567 INFO L273 TraceCheckUtils]: 63: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,569 INFO L273 TraceCheckUtils]: 67: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,569 INFO L273 TraceCheckUtils]: 68: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,570 INFO L273 TraceCheckUtils]: 69: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,570 INFO L273 TraceCheckUtils]: 70: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,571 INFO L273 TraceCheckUtils]: 72: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,571 INFO L273 TraceCheckUtils]: 73: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,572 INFO L273 TraceCheckUtils]: 74: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,572 INFO L273 TraceCheckUtils]: 75: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,573 INFO L273 TraceCheckUtils]: 76: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,573 INFO L273 TraceCheckUtils]: 77: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,574 INFO L273 TraceCheckUtils]: 79: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,575 INFO L273 TraceCheckUtils]: 81: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,576 INFO L273 TraceCheckUtils]: 82: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,576 INFO L273 TraceCheckUtils]: 83: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,577 INFO L273 TraceCheckUtils]: 84: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,577 INFO L273 TraceCheckUtils]: 85: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,578 INFO L273 TraceCheckUtils]: 86: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,578 INFO L273 TraceCheckUtils]: 87: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,579 INFO L273 TraceCheckUtils]: 88: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,579 INFO L273 TraceCheckUtils]: 89: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,580 INFO L273 TraceCheckUtils]: 90: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,580 INFO L273 TraceCheckUtils]: 91: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,581 INFO L273 TraceCheckUtils]: 92: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,581 INFO L273 TraceCheckUtils]: 93: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,582 INFO L273 TraceCheckUtils]: 94: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,582 INFO L273 TraceCheckUtils]: 95: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,583 INFO L273 TraceCheckUtils]: 96: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,583 INFO L273 TraceCheckUtils]: 97: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,603 INFO L273 TraceCheckUtils]: 98: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,603 INFO L273 TraceCheckUtils]: 99: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,604 INFO L273 TraceCheckUtils]: 100: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,604 INFO L273 TraceCheckUtils]: 101: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,604 INFO L273 TraceCheckUtils]: 102: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,607 INFO L273 TraceCheckUtils]: 103: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,607 INFO L273 TraceCheckUtils]: 104: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,609 INFO L273 TraceCheckUtils]: 105: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,609 INFO L273 TraceCheckUtils]: 106: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,611 INFO L273 TraceCheckUtils]: 107: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,611 INFO L273 TraceCheckUtils]: 108: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,613 INFO L273 TraceCheckUtils]: 109: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,613 INFO L273 TraceCheckUtils]: 110: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,615 INFO L273 TraceCheckUtils]: 111: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,615 INFO L273 TraceCheckUtils]: 112: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,617 INFO L273 TraceCheckUtils]: 113: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,617 INFO L273 TraceCheckUtils]: 114: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,619 INFO L273 TraceCheckUtils]: 115: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:23,619 INFO L273 TraceCheckUtils]: 116: Hoare triple {6594#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:23,621 INFO L273 TraceCheckUtils]: 117: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume true; {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:23,621 INFO L273 TraceCheckUtils]: 118: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:23,624 INFO L273 TraceCheckUtils]: 119: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:23,624 INFO L273 TraceCheckUtils]: 120: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:23,627 INFO L273 TraceCheckUtils]: 121: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume true; {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:23,627 INFO L273 TraceCheckUtils]: 122: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:23,628 INFO L273 TraceCheckUtils]: 123: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:23,628 INFO L273 TraceCheckUtils]: 124: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:18:23,630 INFO L273 TraceCheckUtils]: 125: Hoare triple {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume true; {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:18:23,630 INFO L273 TraceCheckUtils]: 126: Hoare triple {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(~i~0 < ~edgecount~0); {6570#false} is VALID [2018-11-14 19:18:23,630 INFO L273 TraceCheckUtils]: 127: Hoare triple {6570#false} ~i~0 := 0; {6570#false} is VALID [2018-11-14 19:18:23,630 INFO L273 TraceCheckUtils]: 128: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-14 19:18:23,630 INFO L273 TraceCheckUtils]: 129: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {6570#false} is VALID [2018-11-14 19:18:23,631 INFO L256 TraceCheckUtils]: 130: Hoare triple {6570#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {6570#false} is VALID [2018-11-14 19:18:23,631 INFO L273 TraceCheckUtils]: 131: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2018-11-14 19:18:23,631 INFO L273 TraceCheckUtils]: 132: Hoare triple {6570#false} assume ~cond == 0; {6570#false} is VALID [2018-11-14 19:18:23,631 INFO L273 TraceCheckUtils]: 133: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2018-11-14 19:18:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-11-14 19:18:23,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:23,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-14 19:18:23,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 134 [2018-11-14 19:18:23,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:23,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:18:23,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:23,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:18:23,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:18:23,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:18:23,778 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand 11 states. [2018-11-14 19:18:24,461 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-14 19:18:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:25,605 INFO L93 Difference]: Finished difference Result 284 states and 344 transitions. [2018-11-14 19:18:25,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 19:18:25,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 134 [2018-11-14 19:18:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 222 transitions. [2018-11-14 19:18:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 222 transitions. [2018-11-14 19:18:25,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 222 transitions. [2018-11-14 19:18:26,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:26,323 INFO L225 Difference]: With dead ends: 284 [2018-11-14 19:18:26,323 INFO L226 Difference]: Without dead ends: 190 [2018-11-14 19:18:26,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=415, Unknown=0, NotChecked=0, Total=650 [2018-11-14 19:18:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-14 19:18:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-11-14 19:18:26,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:26,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 163 states. [2018-11-14 19:18:26,594 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 163 states. [2018-11-14 19:18:26,594 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 163 states. [2018-11-14 19:18:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:26,598 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2018-11-14 19:18:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-11-14 19:18:26,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:26,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:26,600 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 190 states. [2018-11-14 19:18:26,600 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 190 states. [2018-11-14 19:18:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:26,604 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2018-11-14 19:18:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-11-14 19:18:26,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:26,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:26,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:26,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-14 19:18:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2018-11-14 19:18:26,609 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 134 [2018-11-14 19:18:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:26,610 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2018-11-14 19:18:26,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:18:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2018-11-14 19:18:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-14 19:18:26,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:26,612 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:26,612 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:26,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash -539808240, now seen corresponding path program 4 times [2018-11-14 19:18:26,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:26,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:26,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:27,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {7967#true} call ULTIMATE.init(); {7967#true} is VALID [2018-11-14 19:18:27,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {7967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {7967#true} is VALID [2018-11-14 19:18:27,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7967#true} {7967#true} #108#return; {7967#true} is VALID [2018-11-14 19:18:27,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {7967#true} call #t~ret18 := main(); {7967#true} is VALID [2018-11-14 19:18:27,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {7967#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {7969#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {7969#(= main_~edgecount~0 20)} ~i~0 := 0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,172 INFO L273 TraceCheckUtils]: 35: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,173 INFO L273 TraceCheckUtils]: 37: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,173 INFO L273 TraceCheckUtils]: 38: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,175 INFO L273 TraceCheckUtils]: 41: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,176 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,176 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,194 INFO L273 TraceCheckUtils]: 45: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,197 INFO L273 TraceCheckUtils]: 47: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,197 INFO L273 TraceCheckUtils]: 49: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:27,198 INFO L273 TraceCheckUtils]: 51: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,198 INFO L273 TraceCheckUtils]: 52: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,201 INFO L273 TraceCheckUtils]: 56: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,206 INFO L273 TraceCheckUtils]: 62: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,208 INFO L273 TraceCheckUtils]: 64: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,209 INFO L273 TraceCheckUtils]: 65: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,209 INFO L273 TraceCheckUtils]: 66: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,210 INFO L273 TraceCheckUtils]: 67: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,211 INFO L273 TraceCheckUtils]: 68: Hoare triple {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume true; {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:27,212 INFO L273 TraceCheckUtils]: 69: Hoare triple {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-14 19:18:27,212 INFO L273 TraceCheckUtils]: 70: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7968#false} is VALID [2018-11-14 19:18:27,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7968#false} is VALID [2018-11-14 19:18:27,212 INFO L273 TraceCheckUtils]: 73: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,213 INFO L273 TraceCheckUtils]: 75: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 78: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 80: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 81: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 82: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 83: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 84: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 85: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 87: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 88: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 89: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 90: Hoare triple {7968#false} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 92: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 93: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7968#false} is VALID [2018-11-14 19:18:27,215 INFO L273 TraceCheckUtils]: 94: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 95: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 96: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 97: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 98: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 99: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 100: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 101: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,216 INFO L273 TraceCheckUtils]: 102: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 103: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 104: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 105: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 106: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 107: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 108: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 109: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,217 INFO L273 TraceCheckUtils]: 110: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 111: Hoare triple {7968#false} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 112: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 113: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 114: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 115: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 116: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 117: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,218 INFO L273 TraceCheckUtils]: 118: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 119: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 120: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 121: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 122: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 123: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 124: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 125: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,219 INFO L273 TraceCheckUtils]: 126: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,220 INFO L273 TraceCheckUtils]: 127: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,220 INFO L273 TraceCheckUtils]: 128: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,220 INFO L273 TraceCheckUtils]: 129: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {7968#false} is VALID [2018-11-14 19:18:27,220 INFO L273 TraceCheckUtils]: 130: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {7968#false} is VALID [2018-11-14 19:18:27,220 INFO L273 TraceCheckUtils]: 131: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,220 INFO L273 TraceCheckUtils]: 132: Hoare triple {7968#false} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-14 19:18:27,220 INFO L273 TraceCheckUtils]: 133: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 134: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 135: Hoare triple {7968#false} assume !(~i~0 < ~nodecount~0); {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 136: Hoare triple {7968#false} ~i~0 := 0; {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 137: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 138: Hoare triple {7968#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 139: Hoare triple {7968#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 140: Hoare triple {7968#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 141: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,221 INFO L273 TraceCheckUtils]: 142: Hoare triple {7968#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 143: Hoare triple {7968#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 144: Hoare triple {7968#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 145: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 146: Hoare triple {7968#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 147: Hoare triple {7968#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 148: Hoare triple {7968#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 149: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,222 INFO L273 TraceCheckUtils]: 150: Hoare triple {7968#false} assume !(~i~0 < ~edgecount~0); {7968#false} is VALID [2018-11-14 19:18:27,223 INFO L273 TraceCheckUtils]: 151: Hoare triple {7968#false} ~i~0 := 0; {7968#false} is VALID [2018-11-14 19:18:27,223 INFO L273 TraceCheckUtils]: 152: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,223 INFO L273 TraceCheckUtils]: 153: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,223 INFO L256 TraceCheckUtils]: 154: Hoare triple {7968#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {7968#false} is VALID [2018-11-14 19:18:27,223 INFO L273 TraceCheckUtils]: 155: Hoare triple {7968#false} ~cond := #in~cond; {7968#false} is VALID [2018-11-14 19:18:27,223 INFO L273 TraceCheckUtils]: 156: Hoare triple {7968#false} assume ~cond == 0; {7968#false} is VALID [2018-11-14 19:18:27,223 INFO L273 TraceCheckUtils]: 157: Hoare triple {7968#false} assume !false; {7968#false} is VALID [2018-11-14 19:18:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 594 proven. 32 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-14 19:18:27,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:27,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:27,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:18:27,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:18:27,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:27,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:27,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {7967#true} call ULTIMATE.init(); {7967#true} is VALID [2018-11-14 19:18:27,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {7967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {7967#true} is VALID [2018-11-14 19:18:27,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7967#true} {7967#true} #108#return; {7967#true} is VALID [2018-11-14 19:18:27,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {7967#true} call #t~ret18 := main(); {7967#true} is VALID [2018-11-14 19:18:27,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {7967#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7967#true} is VALID [2018-11-14 19:18:27,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-14 19:18:27,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {7967#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7967#true} is VALID [2018-11-14 19:18:27,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7967#true} is VALID [2018-11-14 19:18:27,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7967#true} is VALID [2018-11-14 19:18:27,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 22: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 23: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 24: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 25: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {7967#true} assume !(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-14 19:18:27,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {7967#true} ~i~0 := 0; {7967#true} is VALID [2018-11-14 19:18:27,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-14 19:18:27,659 INFO L273 TraceCheckUtils]: 30: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8068#(<= 0 main_~j~0)} is VALID [2018-11-14 19:18:27,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {8068#(<= 0 main_~j~0)} assume true; {8068#(<= 0 main_~j~0)} is VALID [2018-11-14 19:18:27,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {8068#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8068#(<= 0 main_~j~0)} is VALID [2018-11-14 19:18:27,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {8068#(<= 0 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8068#(<= 0 main_~j~0)} is VALID [2018-11-14 19:18:27,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {8068#(<= 0 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8081#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:27,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {8081#(<= 1 main_~j~0)} assume true; {8081#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:27,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {8081#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8081#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:27,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {8081#(<= 1 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8081#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:27,662 INFO L273 TraceCheckUtils]: 38: Hoare triple {8081#(<= 1 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8094#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:27,663 INFO L273 TraceCheckUtils]: 39: Hoare triple {8094#(<= 2 main_~j~0)} assume true; {8094#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:27,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {8094#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8094#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:27,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {8094#(<= 2 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8094#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:27,664 INFO L273 TraceCheckUtils]: 42: Hoare triple {8094#(<= 2 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8107#(<= 3 main_~j~0)} is VALID [2018-11-14 19:18:27,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {8107#(<= 3 main_~j~0)} assume true; {8107#(<= 3 main_~j~0)} is VALID [2018-11-14 19:18:27,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {8107#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,669 INFO L273 TraceCheckUtils]: 49: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,669 INFO L273 TraceCheckUtils]: 50: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,672 INFO L273 TraceCheckUtils]: 55: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,672 INFO L273 TraceCheckUtils]: 56: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,673 INFO L273 TraceCheckUtils]: 58: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,697 INFO L273 TraceCheckUtils]: 60: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,697 INFO L273 TraceCheckUtils]: 61: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,698 INFO L273 TraceCheckUtils]: 62: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,698 INFO L273 TraceCheckUtils]: 63: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,698 INFO L273 TraceCheckUtils]: 64: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,699 INFO L273 TraceCheckUtils]: 65: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,699 INFO L273 TraceCheckUtils]: 66: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,699 INFO L273 TraceCheckUtils]: 67: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,699 INFO L273 TraceCheckUtils]: 68: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,700 INFO L273 TraceCheckUtils]: 69: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,700 INFO L273 TraceCheckUtils]: 70: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,701 INFO L273 TraceCheckUtils]: 71: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,701 INFO L273 TraceCheckUtils]: 72: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,702 INFO L273 TraceCheckUtils]: 73: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,702 INFO L273 TraceCheckUtils]: 74: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,703 INFO L273 TraceCheckUtils]: 75: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,703 INFO L273 TraceCheckUtils]: 76: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,704 INFO L273 TraceCheckUtils]: 77: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,704 INFO L273 TraceCheckUtils]: 78: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,705 INFO L273 TraceCheckUtils]: 79: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,705 INFO L273 TraceCheckUtils]: 80: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,706 INFO L273 TraceCheckUtils]: 81: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,707 INFO L273 TraceCheckUtils]: 84: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,708 INFO L273 TraceCheckUtils]: 85: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,708 INFO L273 TraceCheckUtils]: 86: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,709 INFO L273 TraceCheckUtils]: 87: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,709 INFO L273 TraceCheckUtils]: 88: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,710 INFO L273 TraceCheckUtils]: 89: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,710 INFO L273 TraceCheckUtils]: 90: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,711 INFO L273 TraceCheckUtils]: 91: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,711 INFO L273 TraceCheckUtils]: 92: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,712 INFO L273 TraceCheckUtils]: 93: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,712 INFO L273 TraceCheckUtils]: 94: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,713 INFO L273 TraceCheckUtils]: 95: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,713 INFO L273 TraceCheckUtils]: 96: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,714 INFO L273 TraceCheckUtils]: 97: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,714 INFO L273 TraceCheckUtils]: 98: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,715 INFO L273 TraceCheckUtils]: 99: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,715 INFO L273 TraceCheckUtils]: 100: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,716 INFO L273 TraceCheckUtils]: 101: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,716 INFO L273 TraceCheckUtils]: 102: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,717 INFO L273 TraceCheckUtils]: 103: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,717 INFO L273 TraceCheckUtils]: 104: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,717 INFO L273 TraceCheckUtils]: 105: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,718 INFO L273 TraceCheckUtils]: 106: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,718 INFO L273 TraceCheckUtils]: 107: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,719 INFO L273 TraceCheckUtils]: 108: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,719 INFO L273 TraceCheckUtils]: 109: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,720 INFO L273 TraceCheckUtils]: 110: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,720 INFO L273 TraceCheckUtils]: 111: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,721 INFO L273 TraceCheckUtils]: 112: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,721 INFO L273 TraceCheckUtils]: 113: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,722 INFO L273 TraceCheckUtils]: 114: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,722 INFO L273 TraceCheckUtils]: 115: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,723 INFO L273 TraceCheckUtils]: 116: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,723 INFO L273 TraceCheckUtils]: 117: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,724 INFO L273 TraceCheckUtils]: 118: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,724 INFO L273 TraceCheckUtils]: 119: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,725 INFO L273 TraceCheckUtils]: 120: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,725 INFO L273 TraceCheckUtils]: 121: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,726 INFO L273 TraceCheckUtils]: 122: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,726 INFO L273 TraceCheckUtils]: 123: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,727 INFO L273 TraceCheckUtils]: 124: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,727 INFO L273 TraceCheckUtils]: 125: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,728 INFO L273 TraceCheckUtils]: 126: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,728 INFO L273 TraceCheckUtils]: 127: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,729 INFO L273 TraceCheckUtils]: 128: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,729 INFO L273 TraceCheckUtils]: 129: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,730 INFO L273 TraceCheckUtils]: 130: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,730 INFO L273 TraceCheckUtils]: 131: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,731 INFO L273 TraceCheckUtils]: 132: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,731 INFO L273 TraceCheckUtils]: 133: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,732 INFO L273 TraceCheckUtils]: 134: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,732 INFO L273 TraceCheckUtils]: 135: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-14 19:18:27,733 INFO L273 TraceCheckUtils]: 136: Hoare triple {8114#(<= 4 main_~edgecount~0)} ~i~0 := 0; {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:27,733 INFO L273 TraceCheckUtils]: 137: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} assume true; {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:27,734 INFO L273 TraceCheckUtils]: 138: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:27,735 INFO L273 TraceCheckUtils]: 139: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:27,736 INFO L273 TraceCheckUtils]: 140: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:27,736 INFO L273 TraceCheckUtils]: 141: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} assume true; {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:27,737 INFO L273 TraceCheckUtils]: 142: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:27,738 INFO L273 TraceCheckUtils]: 143: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:27,739 INFO L273 TraceCheckUtils]: 144: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-14 19:18:27,739 INFO L273 TraceCheckUtils]: 145: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume true; {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-14 19:18:27,740 INFO L273 TraceCheckUtils]: 146: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-14 19:18:27,741 INFO L273 TraceCheckUtils]: 147: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-14 19:18:27,742 INFO L273 TraceCheckUtils]: 148: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} is VALID [2018-11-14 19:18:27,742 INFO L273 TraceCheckUtils]: 149: Hoare triple {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} assume true; {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} is VALID [2018-11-14 19:18:27,743 INFO L273 TraceCheckUtils]: 150: Hoare triple {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {7968#false} is VALID [2018-11-14 19:18:27,743 INFO L273 TraceCheckUtils]: 151: Hoare triple {7968#false} ~i~0 := 0; {7968#false} is VALID [2018-11-14 19:18:27,743 INFO L273 TraceCheckUtils]: 152: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-14 19:18:27,744 INFO L273 TraceCheckUtils]: 153: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {7968#false} is VALID [2018-11-14 19:18:27,744 INFO L256 TraceCheckUtils]: 154: Hoare triple {7968#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {7968#false} is VALID [2018-11-14 19:18:27,744 INFO L273 TraceCheckUtils]: 155: Hoare triple {7968#false} ~cond := #in~cond; {7968#false} is VALID [2018-11-14 19:18:27,744 INFO L273 TraceCheckUtils]: 156: Hoare triple {7968#false} assume ~cond == 0; {7968#false} is VALID [2018-11-14 19:18:27,744 INFO L273 TraceCheckUtils]: 157: Hoare triple {7968#false} assume !false; {7968#false} is VALID [2018-11-14 19:18:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 28 proven. 288 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2018-11-14 19:18:27,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:27,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-11-14 19:18:27,782 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2018-11-14 19:18:27,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:27,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 19:18:27,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:27,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 19:18:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 19:18:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:18:27,888 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand 17 states. [2018-11-14 19:18:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:31,108 INFO L93 Difference]: Finished difference Result 333 states and 403 transitions. [2018-11-14 19:18:31,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 19:18:31,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2018-11-14 19:18:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:18:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 291 transitions. [2018-11-14 19:18:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:18:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 291 transitions. [2018-11-14 19:18:31,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 291 transitions. [2018-11-14 19:18:31,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:31,884 INFO L225 Difference]: With dead ends: 333 [2018-11-14 19:18:31,884 INFO L226 Difference]: Without dead ends: 219 [2018-11-14 19:18:31,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=597, Invalid=1853, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 19:18:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-14 19:18:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 187. [2018-11-14 19:18:32,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:32,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 187 states. [2018-11-14 19:18:32,455 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 187 states. [2018-11-14 19:18:32,455 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 187 states. [2018-11-14 19:18:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:32,463 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2018-11-14 19:18:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2018-11-14 19:18:32,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:32,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:32,464 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 219 states. [2018-11-14 19:18:32,464 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 219 states. [2018-11-14 19:18:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:32,470 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2018-11-14 19:18:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2018-11-14 19:18:32,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:32,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:32,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:32,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-14 19:18:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2018-11-14 19:18:32,475 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 158 [2018-11-14 19:18:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:32,476 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2018-11-14 19:18:32,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 19:18:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2018-11-14 19:18:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-14 19:18:32,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:32,478 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:32,479 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:32,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1971220322, now seen corresponding path program 5 times [2018-11-14 19:18:32,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:32,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:32,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:33,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2018-11-14 19:18:33,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {9633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {9633#true} is VALID [2018-11-14 19:18:33,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2018-11-14 19:18:33,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #108#return; {9633#true} is VALID [2018-11-14 19:18:33,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret18 := main(); {9633#true} is VALID [2018-11-14 19:18:33,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {9633#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {9635#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {9635#(= main_~edgecount~0 20)} ~i~0 := 0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,034 INFO L273 TraceCheckUtils]: 31: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,034 INFO L273 TraceCheckUtils]: 32: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,035 INFO L273 TraceCheckUtils]: 33: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,035 INFO L273 TraceCheckUtils]: 34: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,036 INFO L273 TraceCheckUtils]: 35: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,036 INFO L273 TraceCheckUtils]: 36: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,037 INFO L273 TraceCheckUtils]: 37: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,037 INFO L273 TraceCheckUtils]: 38: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,038 INFO L273 TraceCheckUtils]: 40: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,039 INFO L273 TraceCheckUtils]: 41: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,039 INFO L273 TraceCheckUtils]: 42: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,040 INFO L273 TraceCheckUtils]: 43: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,040 INFO L273 TraceCheckUtils]: 44: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,041 INFO L273 TraceCheckUtils]: 45: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,041 INFO L273 TraceCheckUtils]: 46: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,042 INFO L273 TraceCheckUtils]: 48: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,043 INFO L273 TraceCheckUtils]: 49: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:18:33,046 INFO L273 TraceCheckUtils]: 55: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,047 INFO L273 TraceCheckUtils]: 56: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,048 INFO L273 TraceCheckUtils]: 58: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,049 INFO L273 TraceCheckUtils]: 59: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,050 INFO L273 TraceCheckUtils]: 60: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,051 INFO L273 TraceCheckUtils]: 61: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,051 INFO L273 TraceCheckUtils]: 62: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,052 INFO L273 TraceCheckUtils]: 63: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,053 INFO L273 TraceCheckUtils]: 64: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,054 INFO L273 TraceCheckUtils]: 65: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,055 INFO L273 TraceCheckUtils]: 66: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,055 INFO L273 TraceCheckUtils]: 67: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,056 INFO L273 TraceCheckUtils]: 68: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,057 INFO L273 TraceCheckUtils]: 69: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,058 INFO L273 TraceCheckUtils]: 71: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume true; {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,060 INFO L273 TraceCheckUtils]: 73: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,060 INFO L273 TraceCheckUtils]: 74: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,062 INFO L273 TraceCheckUtils]: 76: Hoare triple {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume true; {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:18:33,063 INFO L273 TraceCheckUtils]: 77: Hoare triple {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:33,063 INFO L273 TraceCheckUtils]: 78: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:33,063 INFO L273 TraceCheckUtils]: 79: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,063 INFO L273 TraceCheckUtils]: 80: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-14 19:18:33,063 INFO L273 TraceCheckUtils]: 81: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,064 INFO L273 TraceCheckUtils]: 82: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,064 INFO L273 TraceCheckUtils]: 83: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,064 INFO L273 TraceCheckUtils]: 84: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,064 INFO L273 TraceCheckUtils]: 85: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,064 INFO L273 TraceCheckUtils]: 86: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,065 INFO L273 TraceCheckUtils]: 87: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,065 INFO L273 TraceCheckUtils]: 88: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,065 INFO L273 TraceCheckUtils]: 89: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,066 INFO L273 TraceCheckUtils]: 90: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,066 INFO L273 TraceCheckUtils]: 91: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,066 INFO L273 TraceCheckUtils]: 92: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,066 INFO L273 TraceCheckUtils]: 93: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,066 INFO L273 TraceCheckUtils]: 94: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,066 INFO L273 TraceCheckUtils]: 95: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,067 INFO L273 TraceCheckUtils]: 96: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,067 INFO L273 TraceCheckUtils]: 97: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,067 INFO L273 TraceCheckUtils]: 98: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,067 INFO L273 TraceCheckUtils]: 99: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,067 INFO L273 TraceCheckUtils]: 100: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,067 INFO L273 TraceCheckUtils]: 101: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,068 INFO L273 TraceCheckUtils]: 102: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:33,068 INFO L273 TraceCheckUtils]: 103: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:33,068 INFO L273 TraceCheckUtils]: 104: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,068 INFO L273 TraceCheckUtils]: 105: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-14 19:18:33,068 INFO L273 TraceCheckUtils]: 106: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,068 INFO L273 TraceCheckUtils]: 107: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,069 INFO L273 TraceCheckUtils]: 108: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,069 INFO L273 TraceCheckUtils]: 109: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,069 INFO L273 TraceCheckUtils]: 110: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,069 INFO L273 TraceCheckUtils]: 111: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,069 INFO L273 TraceCheckUtils]: 112: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,069 INFO L273 TraceCheckUtils]: 113: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,070 INFO L273 TraceCheckUtils]: 114: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,070 INFO L273 TraceCheckUtils]: 115: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,070 INFO L273 TraceCheckUtils]: 116: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,070 INFO L273 TraceCheckUtils]: 117: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,070 INFO L273 TraceCheckUtils]: 118: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,070 INFO L273 TraceCheckUtils]: 119: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,071 INFO L273 TraceCheckUtils]: 120: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,071 INFO L273 TraceCheckUtils]: 121: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,071 INFO L273 TraceCheckUtils]: 122: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,071 INFO L273 TraceCheckUtils]: 123: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,071 INFO L273 TraceCheckUtils]: 124: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,071 INFO L273 TraceCheckUtils]: 125: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,072 INFO L273 TraceCheckUtils]: 126: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,072 INFO L273 TraceCheckUtils]: 127: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:33,072 INFO L273 TraceCheckUtils]: 128: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:33,072 INFO L273 TraceCheckUtils]: 129: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,072 INFO L273 TraceCheckUtils]: 130: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-14 19:18:33,072 INFO L273 TraceCheckUtils]: 131: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,073 INFO L273 TraceCheckUtils]: 132: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,073 INFO L273 TraceCheckUtils]: 133: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,073 INFO L273 TraceCheckUtils]: 134: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,073 INFO L273 TraceCheckUtils]: 135: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,073 INFO L273 TraceCheckUtils]: 136: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,073 INFO L273 TraceCheckUtils]: 137: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,074 INFO L273 TraceCheckUtils]: 138: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,074 INFO L273 TraceCheckUtils]: 139: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,074 INFO L273 TraceCheckUtils]: 140: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,074 INFO L273 TraceCheckUtils]: 141: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,074 INFO L273 TraceCheckUtils]: 142: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,074 INFO L273 TraceCheckUtils]: 143: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,075 INFO L273 TraceCheckUtils]: 144: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,075 INFO L273 TraceCheckUtils]: 145: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,075 INFO L273 TraceCheckUtils]: 146: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,075 INFO L273 TraceCheckUtils]: 147: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,075 INFO L273 TraceCheckUtils]: 148: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,075 INFO L273 TraceCheckUtils]: 149: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:33,075 INFO L273 TraceCheckUtils]: 150: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:33,076 INFO L273 TraceCheckUtils]: 151: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,076 INFO L273 TraceCheckUtils]: 152: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:33,076 INFO L273 TraceCheckUtils]: 153: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:33,076 INFO L273 TraceCheckUtils]: 154: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,076 INFO L273 TraceCheckUtils]: 155: Hoare triple {9634#false} assume !(~i~0 < ~nodecount~0); {9634#false} is VALID [2018-11-14 19:18:33,076 INFO L273 TraceCheckUtils]: 156: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-14 19:18:33,077 INFO L273 TraceCheckUtils]: 157: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,077 INFO L273 TraceCheckUtils]: 158: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,077 INFO L273 TraceCheckUtils]: 159: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:33,077 INFO L273 TraceCheckUtils]: 160: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:33,077 INFO L273 TraceCheckUtils]: 161: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,077 INFO L273 TraceCheckUtils]: 162: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,077 INFO L273 TraceCheckUtils]: 163: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 164: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 165: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 166: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 167: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 168: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 169: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 170: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,078 INFO L273 TraceCheckUtils]: 171: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L273 TraceCheckUtils]: 172: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L273 TraceCheckUtils]: 173: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L273 TraceCheckUtils]: 174: Hoare triple {9634#false} assume !(~i~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L273 TraceCheckUtils]: 175: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L273 TraceCheckUtils]: 176: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L273 TraceCheckUtils]: 177: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L256 TraceCheckUtils]: 178: Hoare triple {9634#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {9634#false} is VALID [2018-11-14 19:18:33,079 INFO L273 TraceCheckUtils]: 179: Hoare triple {9634#false} ~cond := #in~cond; {9634#false} is VALID [2018-11-14 19:18:33,080 INFO L273 TraceCheckUtils]: 180: Hoare triple {9634#false} assume ~cond == 0; {9634#false} is VALID [2018-11-14 19:18:33,080 INFO L273 TraceCheckUtils]: 181: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2018-11-14 19:18:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 874 proven. 50 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-11-14 19:18:33,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:33,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:33,105 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:18:39,453 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 19:18:39,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:39,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:39,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2018-11-14 19:18:39,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {9633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {9633#true} is VALID [2018-11-14 19:18:39,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2018-11-14 19:18:39,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #108#return; {9633#true} is VALID [2018-11-14 19:18:39,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret18 := main(); {9633#true} is VALID [2018-11-14 19:18:39,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {9633#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,845 INFO L273 TraceCheckUtils]: 25: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,846 INFO L273 TraceCheckUtils]: 27: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,846 INFO L273 TraceCheckUtils]: 28: Hoare triple {9660#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,848 INFO L273 TraceCheckUtils]: 31: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,849 INFO L273 TraceCheckUtils]: 32: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,853 INFO L273 TraceCheckUtils]: 41: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,854 INFO L273 TraceCheckUtils]: 42: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,854 INFO L273 TraceCheckUtils]: 43: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,855 INFO L273 TraceCheckUtils]: 44: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,856 INFO L273 TraceCheckUtils]: 46: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,857 INFO L273 TraceCheckUtils]: 47: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,858 INFO L273 TraceCheckUtils]: 48: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} is VALID [2018-11-14 19:18:39,858 INFO L273 TraceCheckUtils]: 49: Hoare triple {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} is VALID [2018-11-14 19:18:39,859 INFO L273 TraceCheckUtils]: 50: Hoare triple {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} is VALID [2018-11-14 19:18:39,860 INFO L273 TraceCheckUtils]: 51: Hoare triple {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} assume true; {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} is VALID [2018-11-14 19:18:39,861 INFO L273 TraceCheckUtils]: 52: Hoare triple {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,861 INFO L273 TraceCheckUtils]: 53: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,862 INFO L273 TraceCheckUtils]: 54: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:39,862 INFO L273 TraceCheckUtils]: 55: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:39,863 INFO L273 TraceCheckUtils]: 56: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:39,864 INFO L273 TraceCheckUtils]: 57: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:39,865 INFO L273 TraceCheckUtils]: 58: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:39,866 INFO L273 TraceCheckUtils]: 59: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:39,866 INFO L273 TraceCheckUtils]: 60: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:39,867 INFO L273 TraceCheckUtils]: 61: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:39,868 INFO L273 TraceCheckUtils]: 62: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:39,869 INFO L273 TraceCheckUtils]: 63: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:39,870 INFO L273 TraceCheckUtils]: 64: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:39,871 INFO L273 TraceCheckUtils]: 65: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:39,871 INFO L273 TraceCheckUtils]: 66: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:39,872 INFO L273 TraceCheckUtils]: 67: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:39,873 INFO L273 TraceCheckUtils]: 68: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume true; {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:39,874 INFO L273 TraceCheckUtils]: 69: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:39,875 INFO L273 TraceCheckUtils]: 70: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:39,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:39,876 INFO L273 TraceCheckUtils]: 72: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume true; {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:39,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:39,878 INFO L273 TraceCheckUtils]: 74: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:39,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:39,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume true; {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:39,880 INFO L273 TraceCheckUtils]: 77: Hoare triple {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:39,881 INFO L273 TraceCheckUtils]: 78: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:39,881 INFO L273 TraceCheckUtils]: 79: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-14 19:18:39,881 INFO L273 TraceCheckUtils]: 81: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,882 INFO L273 TraceCheckUtils]: 83: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,882 INFO L273 TraceCheckUtils]: 84: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,882 INFO L273 TraceCheckUtils]: 85: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,882 INFO L273 TraceCheckUtils]: 86: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,883 INFO L273 TraceCheckUtils]: 87: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,883 INFO L273 TraceCheckUtils]: 88: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,883 INFO L273 TraceCheckUtils]: 89: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,883 INFO L273 TraceCheckUtils]: 90: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,883 INFO L273 TraceCheckUtils]: 91: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 92: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 93: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 94: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 95: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 96: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 97: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 98: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,884 INFO L273 TraceCheckUtils]: 99: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 100: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 101: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 102: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 103: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 104: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 105: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 106: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 107: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,885 INFO L273 TraceCheckUtils]: 108: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 109: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 110: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 111: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 112: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 113: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 114: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 115: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,886 INFO L273 TraceCheckUtils]: 116: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 117: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 118: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 119: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 120: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 121: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 122: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 123: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 124: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,887 INFO L273 TraceCheckUtils]: 125: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 126: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 127: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 128: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 129: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 130: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 131: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 132: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,888 INFO L273 TraceCheckUtils]: 133: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 134: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 135: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 136: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 137: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 138: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 139: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 140: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 141: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,889 INFO L273 TraceCheckUtils]: 142: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 143: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 144: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 145: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 146: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 147: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 148: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 149: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {9634#false} is VALID [2018-11-14 19:18:39,890 INFO L273 TraceCheckUtils]: 150: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 151: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 152: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 153: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 154: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 155: Hoare triple {9634#false} assume !(~i~0 < ~nodecount~0); {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 156: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 157: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 158: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,891 INFO L273 TraceCheckUtils]: 159: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:39,892 INFO L273 TraceCheckUtils]: 160: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:39,892 INFO L273 TraceCheckUtils]: 161: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,892 INFO L273 TraceCheckUtils]: 162: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,892 INFO L273 TraceCheckUtils]: 163: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:39,892 INFO L273 TraceCheckUtils]: 164: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:39,892 INFO L273 TraceCheckUtils]: 165: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,893 INFO L273 TraceCheckUtils]: 166: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,893 INFO L273 TraceCheckUtils]: 167: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:39,893 INFO L273 TraceCheckUtils]: 168: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:39,893 INFO L273 TraceCheckUtils]: 169: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,893 INFO L273 TraceCheckUtils]: 170: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,893 INFO L273 TraceCheckUtils]: 171: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {9634#false} is VALID [2018-11-14 19:18:39,894 INFO L273 TraceCheckUtils]: 172: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {9634#false} is VALID [2018-11-14 19:18:39,894 INFO L273 TraceCheckUtils]: 173: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,894 INFO L273 TraceCheckUtils]: 174: Hoare triple {9634#false} assume !(~i~0 < ~edgecount~0); {9634#false} is VALID [2018-11-14 19:18:39,894 INFO L273 TraceCheckUtils]: 175: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-14 19:18:39,894 INFO L273 TraceCheckUtils]: 176: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-14 19:18:39,894 INFO L273 TraceCheckUtils]: 177: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {9634#false} is VALID [2018-11-14 19:18:39,895 INFO L256 TraceCheckUtils]: 178: Hoare triple {9634#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {9634#false} is VALID [2018-11-14 19:18:39,895 INFO L273 TraceCheckUtils]: 179: Hoare triple {9634#false} ~cond := #in~cond; {9634#false} is VALID [2018-11-14 19:18:39,895 INFO L273 TraceCheckUtils]: 180: Hoare triple {9634#false} assume ~cond == 0; {9634#false} is VALID [2018-11-14 19:18:39,895 INFO L273 TraceCheckUtils]: 181: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2018-11-14 19:18:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 892 proven. 50 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-14 19:18:39,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:39,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-11-14 19:18:39,940 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 182 [2018-11-14 19:18:39,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:39,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 19:18:40,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:40,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 19:18:40,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 19:18:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=176, Unknown=0, NotChecked=0, Total=306 [2018-11-14 19:18:40,124 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand 18 states. [2018-11-14 19:18:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:41,908 INFO L93 Difference]: Finished difference Result 361 states and 440 transitions. [2018-11-14 19:18:41,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 19:18:41,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 182 [2018-11-14 19:18:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:18:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2018-11-14 19:18:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:18:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2018-11-14 19:18:41,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2018-11-14 19:18:42,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:42,089 INFO L225 Difference]: With dead ends: 361 [2018-11-14 19:18:42,089 INFO L226 Difference]: Without dead ends: 227 [2018-11-14 19:18:42,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:18:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-14 19:18:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-11-14 19:18:42,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:42,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand 227 states. [2018-11-14 19:18:42,623 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 227 states. [2018-11-14 19:18:42,623 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 227 states. [2018-11-14 19:18:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:42,628 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2018-11-14 19:18:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-11-14 19:18:42,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:42,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:42,630 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 227 states. [2018-11-14 19:18:42,630 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 227 states. [2018-11-14 19:18:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:42,636 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2018-11-14 19:18:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-11-14 19:18:42,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:42,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:42,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:42,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-14 19:18:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2018-11-14 19:18:42,643 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 182 [2018-11-14 19:18:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:42,643 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2018-11-14 19:18:42,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 19:18:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-11-14 19:18:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-14 19:18:42,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:42,646 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:42,647 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:42,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:42,647 INFO L82 PathProgramCache]: Analyzing trace with hash -464172140, now seen corresponding path program 6 times [2018-11-14 19:18:42,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:42,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:42,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:43,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {11407#true} call ULTIMATE.init(); {11407#true} is VALID [2018-11-14 19:18:43,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {11407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {11407#true} is VALID [2018-11-14 19:18:43,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11407#true} #108#return; {11407#true} is VALID [2018-11-14 19:18:43,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {11407#true} call #t~ret18 := main(); {11407#true} is VALID [2018-11-14 19:18:43,343 INFO L273 TraceCheckUtils]: 5: Hoare triple {11407#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11407#true} is VALID [2018-11-14 19:18:43,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-14 19:18:43,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {11407#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 13: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-14 19:18:43,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 18: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 19: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {11407#true} assume !(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {11407#true} ~i~0 := 0; {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,346 INFO L273 TraceCheckUtils]: 33: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 34: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 40: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,347 INFO L273 TraceCheckUtils]: 41: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 48: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 49: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,348 INFO L273 TraceCheckUtils]: 50: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,349 INFO L273 TraceCheckUtils]: 52: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,350 INFO L273 TraceCheckUtils]: 59: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,350 INFO L273 TraceCheckUtils]: 60: Hoare triple {11407#true} assume !(~j~0 < ~edgecount~0); {11407#true} is VALID [2018-11-14 19:18:43,350 INFO L273 TraceCheckUtils]: 61: Hoare triple {11407#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11407#true} is VALID [2018-11-14 19:18:43,351 INFO L273 TraceCheckUtils]: 62: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,351 INFO L273 TraceCheckUtils]: 63: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11407#true} is VALID [2018-11-14 19:18:43,351 INFO L273 TraceCheckUtils]: 64: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,351 INFO L273 TraceCheckUtils]: 65: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,351 INFO L273 TraceCheckUtils]: 66: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,351 INFO L273 TraceCheckUtils]: 67: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,352 INFO L273 TraceCheckUtils]: 68: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,352 INFO L273 TraceCheckUtils]: 69: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,352 INFO L273 TraceCheckUtils]: 70: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,352 INFO L273 TraceCheckUtils]: 71: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,352 INFO L273 TraceCheckUtils]: 72: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,353 INFO L273 TraceCheckUtils]: 74: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,353 INFO L273 TraceCheckUtils]: 75: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,353 INFO L273 TraceCheckUtils]: 76: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,353 INFO L273 TraceCheckUtils]: 77: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,353 INFO L273 TraceCheckUtils]: 78: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,354 INFO L273 TraceCheckUtils]: 79: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,354 INFO L273 TraceCheckUtils]: 80: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,354 INFO L273 TraceCheckUtils]: 81: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,354 INFO L273 TraceCheckUtils]: 82: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,354 INFO L273 TraceCheckUtils]: 83: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,355 INFO L273 TraceCheckUtils]: 84: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,355 INFO L273 TraceCheckUtils]: 86: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,355 INFO L273 TraceCheckUtils]: 87: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,355 INFO L273 TraceCheckUtils]: 88: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,355 INFO L273 TraceCheckUtils]: 89: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,356 INFO L273 TraceCheckUtils]: 90: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,356 INFO L273 TraceCheckUtils]: 91: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,356 INFO L273 TraceCheckUtils]: 92: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,356 INFO L273 TraceCheckUtils]: 93: Hoare triple {11407#true} assume !(~j~0 < ~edgecount~0); {11407#true} is VALID [2018-11-14 19:18:43,356 INFO L273 TraceCheckUtils]: 94: Hoare triple {11407#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11407#true} is VALID [2018-11-14 19:18:43,357 INFO L273 TraceCheckUtils]: 95: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,357 INFO L273 TraceCheckUtils]: 96: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11407#true} is VALID [2018-11-14 19:18:43,357 INFO L273 TraceCheckUtils]: 97: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,357 INFO L273 TraceCheckUtils]: 98: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,357 INFO L273 TraceCheckUtils]: 99: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,358 INFO L273 TraceCheckUtils]: 100: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,358 INFO L273 TraceCheckUtils]: 101: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,358 INFO L273 TraceCheckUtils]: 102: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,358 INFO L273 TraceCheckUtils]: 103: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,359 INFO L273 TraceCheckUtils]: 104: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,359 INFO L273 TraceCheckUtils]: 105: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,359 INFO L273 TraceCheckUtils]: 106: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,359 INFO L273 TraceCheckUtils]: 107: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,359 INFO L273 TraceCheckUtils]: 108: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,360 INFO L273 TraceCheckUtils]: 109: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,360 INFO L273 TraceCheckUtils]: 110: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,360 INFO L273 TraceCheckUtils]: 111: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,360 INFO L273 TraceCheckUtils]: 112: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,360 INFO L273 TraceCheckUtils]: 113: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,361 INFO L273 TraceCheckUtils]: 114: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,361 INFO L273 TraceCheckUtils]: 115: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,361 INFO L273 TraceCheckUtils]: 116: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,361 INFO L273 TraceCheckUtils]: 117: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,361 INFO L273 TraceCheckUtils]: 118: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,362 INFO L273 TraceCheckUtils]: 119: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,362 INFO L273 TraceCheckUtils]: 120: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,362 INFO L273 TraceCheckUtils]: 121: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,362 INFO L273 TraceCheckUtils]: 122: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11407#true} is VALID [2018-11-14 19:18:43,362 INFO L273 TraceCheckUtils]: 123: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11407#true} is VALID [2018-11-14 19:18:43,363 INFO L273 TraceCheckUtils]: 124: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11407#true} is VALID [2018-11-14 19:18:43,363 INFO L273 TraceCheckUtils]: 125: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,363 INFO L273 TraceCheckUtils]: 126: Hoare triple {11407#true} assume !(~j~0 < ~edgecount~0); {11407#true} is VALID [2018-11-14 19:18:43,363 INFO L273 TraceCheckUtils]: 127: Hoare triple {11407#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11407#true} is VALID [2018-11-14 19:18:43,364 INFO L273 TraceCheckUtils]: 128: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:43,385 INFO L273 TraceCheckUtils]: 129: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11409#(= main_~j~0 0)} is VALID [2018-11-14 19:18:43,398 INFO L273 TraceCheckUtils]: 130: Hoare triple {11409#(= main_~j~0 0)} assume true; {11409#(= main_~j~0 0)} is VALID [2018-11-14 19:18:43,403 INFO L273 TraceCheckUtils]: 131: Hoare triple {11409#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11409#(= main_~j~0 0)} is VALID [2018-11-14 19:18:43,404 INFO L273 TraceCheckUtils]: 132: Hoare triple {11409#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11409#(= main_~j~0 0)} is VALID [2018-11-14 19:18:43,404 INFO L273 TraceCheckUtils]: 133: Hoare triple {11409#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11410#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:43,406 INFO L273 TraceCheckUtils]: 134: Hoare triple {11410#(<= 1 main_~j~0)} assume true; {11410#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:43,406 INFO L273 TraceCheckUtils]: 135: Hoare triple {11410#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11410#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:43,408 INFO L273 TraceCheckUtils]: 136: Hoare triple {11410#(<= 1 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11410#(<= 1 main_~j~0)} is VALID [2018-11-14 19:18:43,408 INFO L273 TraceCheckUtils]: 137: Hoare triple {11410#(<= 1 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11411#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:43,410 INFO L273 TraceCheckUtils]: 138: Hoare triple {11411#(<= 2 main_~j~0)} assume true; {11411#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:43,410 INFO L273 TraceCheckUtils]: 139: Hoare triple {11411#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11411#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:43,413 INFO L273 TraceCheckUtils]: 140: Hoare triple {11411#(<= 2 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11411#(<= 2 main_~j~0)} is VALID [2018-11-14 19:18:43,413 INFO L273 TraceCheckUtils]: 141: Hoare triple {11411#(<= 2 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11412#(<= 3 main_~j~0)} is VALID [2018-11-14 19:18:43,415 INFO L273 TraceCheckUtils]: 142: Hoare triple {11412#(<= 3 main_~j~0)} assume true; {11412#(<= 3 main_~j~0)} is VALID [2018-11-14 19:18:43,415 INFO L273 TraceCheckUtils]: 143: Hoare triple {11412#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11412#(<= 3 main_~j~0)} is VALID [2018-11-14 19:18:43,415 INFO L273 TraceCheckUtils]: 144: Hoare triple {11412#(<= 3 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11412#(<= 3 main_~j~0)} is VALID [2018-11-14 19:18:43,416 INFO L273 TraceCheckUtils]: 145: Hoare triple {11412#(<= 3 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11413#(<= 4 main_~j~0)} is VALID [2018-11-14 19:18:43,416 INFO L273 TraceCheckUtils]: 146: Hoare triple {11413#(<= 4 main_~j~0)} assume true; {11413#(<= 4 main_~j~0)} is VALID [2018-11-14 19:18:43,417 INFO L273 TraceCheckUtils]: 147: Hoare triple {11413#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11413#(<= 4 main_~j~0)} is VALID [2018-11-14 19:18:43,417 INFO L273 TraceCheckUtils]: 148: Hoare triple {11413#(<= 4 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11413#(<= 4 main_~j~0)} is VALID [2018-11-14 19:18:43,418 INFO L273 TraceCheckUtils]: 149: Hoare triple {11413#(<= 4 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11414#(<= 5 main_~j~0)} is VALID [2018-11-14 19:18:43,418 INFO L273 TraceCheckUtils]: 150: Hoare triple {11414#(<= 5 main_~j~0)} assume true; {11414#(<= 5 main_~j~0)} is VALID [2018-11-14 19:18:43,419 INFO L273 TraceCheckUtils]: 151: Hoare triple {11414#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11414#(<= 5 main_~j~0)} is VALID [2018-11-14 19:18:43,420 INFO L273 TraceCheckUtils]: 152: Hoare triple {11414#(<= 5 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11414#(<= 5 main_~j~0)} is VALID [2018-11-14 19:18:43,421 INFO L273 TraceCheckUtils]: 153: Hoare triple {11414#(<= 5 main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11415#(<= 6 main_~j~0)} is VALID [2018-11-14 19:18:43,421 INFO L273 TraceCheckUtils]: 154: Hoare triple {11415#(<= 6 main_~j~0)} assume true; {11415#(<= 6 main_~j~0)} is VALID [2018-11-14 19:18:43,423 INFO L273 TraceCheckUtils]: 155: Hoare triple {11415#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,423 INFO L273 TraceCheckUtils]: 156: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,424 INFO L273 TraceCheckUtils]: 157: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,424 INFO L273 TraceCheckUtils]: 158: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,425 INFO L273 TraceCheckUtils]: 159: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,426 INFO L273 TraceCheckUtils]: 160: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,426 INFO L273 TraceCheckUtils]: 161: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,427 INFO L273 TraceCheckUtils]: 162: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,427 INFO L273 TraceCheckUtils]: 163: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,428 INFO L273 TraceCheckUtils]: 164: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,429 INFO L273 TraceCheckUtils]: 165: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,429 INFO L273 TraceCheckUtils]: 166: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,430 INFO L273 TraceCheckUtils]: 167: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,431 INFO L273 TraceCheckUtils]: 168: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,431 INFO L273 TraceCheckUtils]: 169: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,432 INFO L273 TraceCheckUtils]: 170: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,432 INFO L273 TraceCheckUtils]: 171: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,433 INFO L273 TraceCheckUtils]: 172: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,434 INFO L273 TraceCheckUtils]: 173: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,434 INFO L273 TraceCheckUtils]: 174: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,435 INFO L273 TraceCheckUtils]: 175: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,435 INFO L273 TraceCheckUtils]: 176: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,436 INFO L273 TraceCheckUtils]: 177: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,437 INFO L273 TraceCheckUtils]: 178: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,437 INFO L273 TraceCheckUtils]: 179: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,438 INFO L273 TraceCheckUtils]: 180: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,438 INFO L273 TraceCheckUtils]: 181: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,439 INFO L273 TraceCheckUtils]: 182: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,440 INFO L273 TraceCheckUtils]: 183: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,440 INFO L273 TraceCheckUtils]: 184: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,441 INFO L273 TraceCheckUtils]: 185: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,442 INFO L273 TraceCheckUtils]: 186: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,442 INFO L273 TraceCheckUtils]: 187: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,443 INFO L273 TraceCheckUtils]: 188: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,443 INFO L273 TraceCheckUtils]: 189: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,444 INFO L273 TraceCheckUtils]: 190: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,445 INFO L273 TraceCheckUtils]: 191: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,445 INFO L273 TraceCheckUtils]: 192: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,446 INFO L273 TraceCheckUtils]: 193: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,446 INFO L273 TraceCheckUtils]: 194: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,447 INFO L273 TraceCheckUtils]: 195: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-14 19:18:43,448 INFO L273 TraceCheckUtils]: 196: Hoare triple {11416#(<= 7 main_~edgecount~0)} ~i~0 := 0; {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:43,448 INFO L273 TraceCheckUtils]: 197: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} assume true; {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:43,450 INFO L273 TraceCheckUtils]: 198: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:43,450 INFO L273 TraceCheckUtils]: 199: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:43,451 INFO L273 TraceCheckUtils]: 200: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,452 INFO L273 TraceCheckUtils]: 201: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} assume true; {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,453 INFO L273 TraceCheckUtils]: 202: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,453 INFO L273 TraceCheckUtils]: 203: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,454 INFO L273 TraceCheckUtils]: 204: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,455 INFO L273 TraceCheckUtils]: 205: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} assume true; {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,456 INFO L273 TraceCheckUtils]: 206: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,456 INFO L273 TraceCheckUtils]: 207: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,457 INFO L273 TraceCheckUtils]: 208: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,458 INFO L273 TraceCheckUtils]: 209: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} assume true; {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,458 INFO L273 TraceCheckUtils]: 210: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,459 INFO L273 TraceCheckUtils]: 211: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,460 INFO L273 TraceCheckUtils]: 212: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,461 INFO L273 TraceCheckUtils]: 213: Hoare triple {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} assume true; {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-14 19:18:43,461 INFO L273 TraceCheckUtils]: 214: Hoare triple {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {11408#false} is VALID [2018-11-14 19:18:43,462 INFO L273 TraceCheckUtils]: 215: Hoare triple {11408#false} ~i~0 := 0; {11408#false} is VALID [2018-11-14 19:18:43,462 INFO L273 TraceCheckUtils]: 216: Hoare triple {11408#false} assume true; {11408#false} is VALID [2018-11-14 19:18:43,462 INFO L273 TraceCheckUtils]: 217: Hoare triple {11408#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11408#false} is VALID [2018-11-14 19:18:43,462 INFO L256 TraceCheckUtils]: 218: Hoare triple {11408#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {11408#false} is VALID [2018-11-14 19:18:43,463 INFO L273 TraceCheckUtils]: 219: Hoare triple {11408#false} ~cond := #in~cond; {11408#false} is VALID [2018-11-14 19:18:43,463 INFO L273 TraceCheckUtils]: 220: Hoare triple {11408#false} assume ~cond == 0; {11408#false} is VALID [2018-11-14 19:18:43,463 INFO L273 TraceCheckUtils]: 221: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2018-11-14 19:18:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2872 backedges. 1428 proven. 276 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2018-11-14 19:18:43,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:43,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:43,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:18:44,025 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-14 19:18:44,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:44,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:44,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {11407#true} call ULTIMATE.init(); {11407#true} is VALID [2018-11-14 19:18:44,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {11407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {11407#true} is VALID [2018-11-14 19:18:44,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-14 19:18:44,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11407#true} #108#return; {11407#true} is VALID [2018-11-14 19:18:44,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {11407#true} call #t~ret18 := main(); {11407#true} is VALID [2018-11-14 19:18:44,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {11407#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,738 INFO L273 TraceCheckUtils]: 24: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {11440#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,746 INFO L273 TraceCheckUtils]: 40: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,746 INFO L273 TraceCheckUtils]: 41: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,747 INFO L273 TraceCheckUtils]: 43: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,748 INFO L273 TraceCheckUtils]: 45: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,750 INFO L273 TraceCheckUtils]: 49: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,751 INFO L273 TraceCheckUtils]: 51: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,752 INFO L273 TraceCheckUtils]: 53: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,753 INFO L273 TraceCheckUtils]: 54: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,753 INFO L273 TraceCheckUtils]: 55: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,754 INFO L273 TraceCheckUtils]: 57: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,755 INFO L273 TraceCheckUtils]: 58: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,755 INFO L273 TraceCheckUtils]: 59: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,756 INFO L273 TraceCheckUtils]: 61: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,757 INFO L273 TraceCheckUtils]: 62: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,758 INFO L273 TraceCheckUtils]: 64: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,758 INFO L273 TraceCheckUtils]: 65: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,759 INFO L273 TraceCheckUtils]: 67: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,760 INFO L273 TraceCheckUtils]: 68: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,760 INFO L273 TraceCheckUtils]: 69: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,761 INFO L273 TraceCheckUtils]: 70: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,761 INFO L273 TraceCheckUtils]: 71: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,762 INFO L273 TraceCheckUtils]: 72: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,762 INFO L273 TraceCheckUtils]: 73: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,763 INFO L273 TraceCheckUtils]: 74: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,763 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,764 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,764 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,765 INFO L273 TraceCheckUtils]: 78: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,765 INFO L273 TraceCheckUtils]: 79: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,766 INFO L273 TraceCheckUtils]: 80: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,766 INFO L273 TraceCheckUtils]: 81: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,767 INFO L273 TraceCheckUtils]: 82: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,768 INFO L273 TraceCheckUtils]: 83: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,768 INFO L273 TraceCheckUtils]: 84: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,769 INFO L273 TraceCheckUtils]: 85: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,769 INFO L273 TraceCheckUtils]: 86: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,770 INFO L273 TraceCheckUtils]: 87: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,771 INFO L273 TraceCheckUtils]: 88: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,771 INFO L273 TraceCheckUtils]: 89: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,772 INFO L273 TraceCheckUtils]: 90: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,772 INFO L273 TraceCheckUtils]: 91: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,773 INFO L273 TraceCheckUtils]: 92: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,773 INFO L273 TraceCheckUtils]: 93: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,774 INFO L273 TraceCheckUtils]: 94: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,774 INFO L273 TraceCheckUtils]: 95: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,775 INFO L273 TraceCheckUtils]: 96: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,775 INFO L273 TraceCheckUtils]: 97: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,776 INFO L273 TraceCheckUtils]: 98: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,776 INFO L273 TraceCheckUtils]: 99: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,777 INFO L273 TraceCheckUtils]: 100: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,777 INFO L273 TraceCheckUtils]: 101: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,778 INFO L273 TraceCheckUtils]: 102: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,778 INFO L273 TraceCheckUtils]: 103: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,779 INFO L273 TraceCheckUtils]: 104: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,779 INFO L273 TraceCheckUtils]: 105: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,780 INFO L273 TraceCheckUtils]: 106: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,780 INFO L273 TraceCheckUtils]: 107: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,781 INFO L273 TraceCheckUtils]: 108: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,781 INFO L273 TraceCheckUtils]: 109: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,782 INFO L273 TraceCheckUtils]: 110: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,782 INFO L273 TraceCheckUtils]: 111: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,783 INFO L273 TraceCheckUtils]: 112: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,784 INFO L273 TraceCheckUtils]: 113: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,784 INFO L273 TraceCheckUtils]: 114: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,785 INFO L273 TraceCheckUtils]: 115: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,785 INFO L273 TraceCheckUtils]: 116: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,786 INFO L273 TraceCheckUtils]: 117: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,786 INFO L273 TraceCheckUtils]: 118: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,787 INFO L273 TraceCheckUtils]: 119: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,787 INFO L273 TraceCheckUtils]: 120: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,788 INFO L273 TraceCheckUtils]: 121: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,788 INFO L273 TraceCheckUtils]: 122: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,789 INFO L273 TraceCheckUtils]: 123: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,789 INFO L273 TraceCheckUtils]: 124: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,790 INFO L273 TraceCheckUtils]: 125: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,790 INFO L273 TraceCheckUtils]: 126: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,791 INFO L273 TraceCheckUtils]: 127: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,791 INFO L273 TraceCheckUtils]: 128: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,792 INFO L273 TraceCheckUtils]: 129: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,792 INFO L273 TraceCheckUtils]: 130: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,793 INFO L273 TraceCheckUtils]: 131: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,793 INFO L273 TraceCheckUtils]: 132: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,793 INFO L273 TraceCheckUtils]: 133: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,794 INFO L273 TraceCheckUtils]: 134: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,795 INFO L273 TraceCheckUtils]: 135: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,795 INFO L273 TraceCheckUtils]: 136: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,796 INFO L273 TraceCheckUtils]: 137: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,796 INFO L273 TraceCheckUtils]: 138: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,797 INFO L273 TraceCheckUtils]: 139: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,797 INFO L273 TraceCheckUtils]: 140: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,798 INFO L273 TraceCheckUtils]: 141: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,798 INFO L273 TraceCheckUtils]: 142: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,799 INFO L273 TraceCheckUtils]: 143: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,799 INFO L273 TraceCheckUtils]: 144: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,800 INFO L273 TraceCheckUtils]: 145: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,800 INFO L273 TraceCheckUtils]: 146: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,801 INFO L273 TraceCheckUtils]: 147: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,801 INFO L273 TraceCheckUtils]: 148: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,802 INFO L273 TraceCheckUtils]: 149: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,802 INFO L273 TraceCheckUtils]: 150: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,803 INFO L273 TraceCheckUtils]: 151: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,803 INFO L273 TraceCheckUtils]: 152: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,804 INFO L273 TraceCheckUtils]: 153: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,804 INFO L273 TraceCheckUtils]: 154: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,805 INFO L273 TraceCheckUtils]: 155: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,805 INFO L273 TraceCheckUtils]: 156: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,806 INFO L273 TraceCheckUtils]: 157: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,806 INFO L273 TraceCheckUtils]: 158: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,807 INFO L273 TraceCheckUtils]: 159: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,807 INFO L273 TraceCheckUtils]: 160: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,808 INFO L273 TraceCheckUtils]: 161: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,808 INFO L273 TraceCheckUtils]: 162: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,809 INFO L273 TraceCheckUtils]: 163: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,809 INFO L273 TraceCheckUtils]: 164: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,810 INFO L273 TraceCheckUtils]: 165: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,810 INFO L273 TraceCheckUtils]: 166: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,811 INFO L273 TraceCheckUtils]: 167: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,811 INFO L273 TraceCheckUtils]: 168: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,812 INFO L273 TraceCheckUtils]: 169: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,812 INFO L273 TraceCheckUtils]: 170: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,813 INFO L273 TraceCheckUtils]: 171: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,813 INFO L273 TraceCheckUtils]: 172: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,814 INFO L273 TraceCheckUtils]: 173: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,814 INFO L273 TraceCheckUtils]: 174: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,815 INFO L273 TraceCheckUtils]: 175: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,815 INFO L273 TraceCheckUtils]: 176: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,816 INFO L273 TraceCheckUtils]: 177: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,816 INFO L273 TraceCheckUtils]: 178: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,817 INFO L273 TraceCheckUtils]: 179: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,817 INFO L273 TraceCheckUtils]: 180: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,818 INFO L273 TraceCheckUtils]: 181: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,818 INFO L273 TraceCheckUtils]: 182: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,819 INFO L273 TraceCheckUtils]: 183: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,819 INFO L273 TraceCheckUtils]: 184: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,820 INFO L273 TraceCheckUtils]: 185: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,820 INFO L273 TraceCheckUtils]: 186: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,821 INFO L273 TraceCheckUtils]: 187: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,821 INFO L273 TraceCheckUtils]: 188: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,822 INFO L273 TraceCheckUtils]: 189: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,822 INFO L273 TraceCheckUtils]: 190: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,823 INFO L273 TraceCheckUtils]: 191: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,823 INFO L273 TraceCheckUtils]: 192: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,824 INFO L273 TraceCheckUtils]: 193: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,824 INFO L273 TraceCheckUtils]: 194: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,825 INFO L273 TraceCheckUtils]: 195: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:44,826 INFO L273 TraceCheckUtils]: 196: Hoare triple {11440#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:44,826 INFO L273 TraceCheckUtils]: 197: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume true; {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:44,827 INFO L273 TraceCheckUtils]: 198: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:44,828 INFO L273 TraceCheckUtils]: 199: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:18:44,829 INFO L273 TraceCheckUtils]: 200: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:44,829 INFO L273 TraceCheckUtils]: 201: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume true; {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:44,830 INFO L273 TraceCheckUtils]: 202: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:44,831 INFO L273 TraceCheckUtils]: 203: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:18:44,832 INFO L273 TraceCheckUtils]: 204: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:18:44,833 INFO L273 TraceCheckUtils]: 205: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume true; {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:18:44,834 INFO L273 TraceCheckUtils]: 206: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:18:44,834 INFO L273 TraceCheckUtils]: 207: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:18:44,835 INFO L273 TraceCheckUtils]: 208: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-14 19:18:44,836 INFO L273 TraceCheckUtils]: 209: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume true; {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-14 19:18:44,837 INFO L273 TraceCheckUtils]: 210: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-14 19:18:44,837 INFO L273 TraceCheckUtils]: 211: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-14 19:18:44,838 INFO L273 TraceCheckUtils]: 212: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:18:44,839 INFO L273 TraceCheckUtils]: 213: Hoare triple {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume true; {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:18:44,840 INFO L273 TraceCheckUtils]: 214: Hoare triple {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(~i~0 < ~edgecount~0); {11408#false} is VALID [2018-11-14 19:18:44,840 INFO L273 TraceCheckUtils]: 215: Hoare triple {11408#false} ~i~0 := 0; {11408#false} is VALID [2018-11-14 19:18:44,840 INFO L273 TraceCheckUtils]: 216: Hoare triple {11408#false} assume true; {11408#false} is VALID [2018-11-14 19:18:44,840 INFO L273 TraceCheckUtils]: 217: Hoare triple {11408#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {11408#false} is VALID [2018-11-14 19:18:44,840 INFO L256 TraceCheckUtils]: 218: Hoare triple {11408#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {11408#false} is VALID [2018-11-14 19:18:44,841 INFO L273 TraceCheckUtils]: 219: Hoare triple {11408#false} ~cond := #in~cond; {11408#false} is VALID [2018-11-14 19:18:44,841 INFO L273 TraceCheckUtils]: 220: Hoare triple {11408#false} assume ~cond == 0; {11408#false} is VALID [2018-11-14 19:18:44,841 INFO L273 TraceCheckUtils]: 221: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2018-11-14 19:18:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2872 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2840 trivial. 0 not checked. [2018-11-14 19:18:44,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-14 19:18:44,897 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 222 [2018-11-14 19:18:44,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:44,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 19:18:45,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:45,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 19:18:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 19:18:45,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-14 19:18:45,060 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 21 states. [2018-11-14 19:18:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:51,444 INFO L93 Difference]: Finished difference Result 495 states and 600 transitions. [2018-11-14 19:18:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-14 19:18:51,444 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 222 [2018-11-14 19:18:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:18:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 580 transitions. [2018-11-14 19:18:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:18:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 580 transitions. [2018-11-14 19:18:51,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 580 transitions. [2018-11-14 19:18:52,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:52,554 INFO L225 Difference]: With dead ends: 495 [2018-11-14 19:18:52,555 INFO L226 Difference]: Without dead ends: 483 [2018-11-14 19:18:52,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3433 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2355, Invalid=6765, Unknown=0, NotChecked=0, Total=9120 [2018-11-14 19:18:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-11-14 19:18:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 247. [2018-11-14 19:18:53,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:53,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 483 states. Second operand 247 states. [2018-11-14 19:18:53,072 INFO L74 IsIncluded]: Start isIncluded. First operand 483 states. Second operand 247 states. [2018-11-14 19:18:53,072 INFO L87 Difference]: Start difference. First operand 483 states. Second operand 247 states. [2018-11-14 19:18:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:53,087 INFO L93 Difference]: Finished difference Result 483 states and 583 transitions. [2018-11-14 19:18:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 583 transitions. [2018-11-14 19:18:53,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:53,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:53,089 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 483 states. [2018-11-14 19:18:53,089 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 483 states. [2018-11-14 19:18:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:53,104 INFO L93 Difference]: Finished difference Result 483 states and 583 transitions. [2018-11-14 19:18:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 583 transitions. [2018-11-14 19:18:53,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:53,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:53,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:53,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-14 19:18:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 290 transitions. [2018-11-14 19:18:53,112 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 290 transitions. Word has length 222 [2018-11-14 19:18:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:53,112 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 290 transitions. [2018-11-14 19:18:53,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 19:18:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 290 transitions. [2018-11-14 19:18:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-14 19:18:53,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:53,115 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 10, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:53,116 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:53,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1929751567, now seen corresponding path program 7 times [2018-11-14 19:18:53,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:53,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:53,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:53,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:53,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:53,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {14228#true} call ULTIMATE.init(); {14228#true} is VALID [2018-11-14 19:18:53,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {14228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {14228#true} is VALID [2018-11-14 19:18:53,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14228#true} {14228#true} #108#return; {14228#true} is VALID [2018-11-14 19:18:53,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {14228#true} call #t~ret18 := main(); {14228#true} is VALID [2018-11-14 19:18:53,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {14228#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14228#true} is VALID [2018-11-14 19:18:53,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-14 19:18:53,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {14228#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14228#true} is VALID [2018-11-14 19:18:53,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-14 19:18:53,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14228#true} is VALID [2018-11-14 19:18:53,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-14 19:18:53,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14228#true} is VALID [2018-11-14 19:18:53,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-14 19:18:53,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14228#true} is VALID [2018-11-14 19:18:53,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-14 19:18:53,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14228#true} is VALID [2018-11-14 19:18:53,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {14228#true} assume !(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-14 19:18:53,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {14228#true} ~i~0 := 0; {14228#true} is VALID [2018-11-14 19:18:53,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 39: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 43: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,877 INFO L273 TraceCheckUtils]: 46: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 47: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 48: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 49: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 52: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 60: Hoare triple {14228#true} assume !(~j~0 < ~edgecount~0); {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 61: Hoare triple {14228#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 62: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14228#true} is VALID [2018-11-14 19:18:53,879 INFO L273 TraceCheckUtils]: 64: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 65: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 66: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 69: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,880 INFO L273 TraceCheckUtils]: 72: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 73: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 74: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 75: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 77: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 78: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 79: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,881 INFO L273 TraceCheckUtils]: 81: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 83: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 84: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 85: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 86: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 87: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 88: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 89: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 91: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 92: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 93: Hoare triple {14228#true} assume !(~j~0 < ~edgecount~0); {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 94: Hoare triple {14228#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 95: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 96: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 97: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,883 INFO L273 TraceCheckUtils]: 98: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 99: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 100: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 101: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 102: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 103: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 104: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 106: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,884 INFO L273 TraceCheckUtils]: 107: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 108: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 109: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 110: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 111: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 112: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 113: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 114: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 115: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,885 INFO L273 TraceCheckUtils]: 116: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 117: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 118: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 119: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 120: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 121: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 122: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 123: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 124: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14228#true} is VALID [2018-11-14 19:18:53,886 INFO L273 TraceCheckUtils]: 125: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,887 INFO L273 TraceCheckUtils]: 126: Hoare triple {14228#true} assume !(~j~0 < ~edgecount~0); {14228#true} is VALID [2018-11-14 19:18:53,887 INFO L273 TraceCheckUtils]: 127: Hoare triple {14228#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14228#true} is VALID [2018-11-14 19:18:53,887 INFO L273 TraceCheckUtils]: 128: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:53,887 INFO L273 TraceCheckUtils]: 129: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14230#(= main_~j~0 0)} is VALID [2018-11-14 19:18:53,888 INFO L273 TraceCheckUtils]: 130: Hoare triple {14230#(= main_~j~0 0)} assume true; {14230#(= main_~j~0 0)} is VALID [2018-11-14 19:18:53,888 INFO L273 TraceCheckUtils]: 131: Hoare triple {14230#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14230#(= main_~j~0 0)} is VALID [2018-11-14 19:18:53,888 INFO L273 TraceCheckUtils]: 132: Hoare triple {14230#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14230#(= main_~j~0 0)} is VALID [2018-11-14 19:18:53,889 INFO L273 TraceCheckUtils]: 133: Hoare triple {14230#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14231#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:53,889 INFO L273 TraceCheckUtils]: 134: Hoare triple {14231#(<= main_~j~0 1)} assume true; {14231#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:53,889 INFO L273 TraceCheckUtils]: 135: Hoare triple {14231#(<= main_~j~0 1)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14231#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:53,889 INFO L273 TraceCheckUtils]: 136: Hoare triple {14231#(<= main_~j~0 1)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14231#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:53,890 INFO L273 TraceCheckUtils]: 137: Hoare triple {14231#(<= main_~j~0 1)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14232#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:53,890 INFO L273 TraceCheckUtils]: 138: Hoare triple {14232#(<= main_~j~0 2)} assume true; {14232#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:53,891 INFO L273 TraceCheckUtils]: 139: Hoare triple {14232#(<= main_~j~0 2)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14232#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:53,891 INFO L273 TraceCheckUtils]: 140: Hoare triple {14232#(<= main_~j~0 2)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14232#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:53,891 INFO L273 TraceCheckUtils]: 141: Hoare triple {14232#(<= main_~j~0 2)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14233#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:53,892 INFO L273 TraceCheckUtils]: 142: Hoare triple {14233#(<= main_~j~0 3)} assume true; {14233#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:53,892 INFO L273 TraceCheckUtils]: 143: Hoare triple {14233#(<= main_~j~0 3)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14233#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:53,893 INFO L273 TraceCheckUtils]: 144: Hoare triple {14233#(<= main_~j~0 3)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14233#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:53,894 INFO L273 TraceCheckUtils]: 145: Hoare triple {14233#(<= main_~j~0 3)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14234#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:53,894 INFO L273 TraceCheckUtils]: 146: Hoare triple {14234#(<= main_~j~0 4)} assume true; {14234#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:53,895 INFO L273 TraceCheckUtils]: 147: Hoare triple {14234#(<= main_~j~0 4)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14234#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:53,895 INFO L273 TraceCheckUtils]: 148: Hoare triple {14234#(<= main_~j~0 4)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14234#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:53,896 INFO L273 TraceCheckUtils]: 149: Hoare triple {14234#(<= main_~j~0 4)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14235#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:53,896 INFO L273 TraceCheckUtils]: 150: Hoare triple {14235#(<= main_~j~0 5)} assume true; {14235#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:53,897 INFO L273 TraceCheckUtils]: 151: Hoare triple {14235#(<= main_~j~0 5)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14235#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:53,897 INFO L273 TraceCheckUtils]: 152: Hoare triple {14235#(<= main_~j~0 5)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14235#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:53,898 INFO L273 TraceCheckUtils]: 153: Hoare triple {14235#(<= main_~j~0 5)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14236#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:53,898 INFO L273 TraceCheckUtils]: 154: Hoare triple {14236#(<= main_~j~0 6)} assume true; {14236#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:53,899 INFO L273 TraceCheckUtils]: 155: Hoare triple {14236#(<= main_~j~0 6)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14236#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:53,899 INFO L273 TraceCheckUtils]: 156: Hoare triple {14236#(<= main_~j~0 6)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14236#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:53,900 INFO L273 TraceCheckUtils]: 157: Hoare triple {14236#(<= main_~j~0 6)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14237#(<= main_~j~0 7)} is VALID [2018-11-14 19:18:53,901 INFO L273 TraceCheckUtils]: 158: Hoare triple {14237#(<= main_~j~0 7)} assume true; {14237#(<= main_~j~0 7)} is VALID [2018-11-14 19:18:53,901 INFO L273 TraceCheckUtils]: 159: Hoare triple {14237#(<= main_~j~0 7)} assume !(~j~0 < ~edgecount~0); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,902 INFO L273 TraceCheckUtils]: 160: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,902 INFO L273 TraceCheckUtils]: 161: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,903 INFO L273 TraceCheckUtils]: 162: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,903 INFO L273 TraceCheckUtils]: 163: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,904 INFO L273 TraceCheckUtils]: 164: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,904 INFO L273 TraceCheckUtils]: 165: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,905 INFO L273 TraceCheckUtils]: 166: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,905 INFO L273 TraceCheckUtils]: 167: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,906 INFO L273 TraceCheckUtils]: 168: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,906 INFO L273 TraceCheckUtils]: 169: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,907 INFO L273 TraceCheckUtils]: 170: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,907 INFO L273 TraceCheckUtils]: 171: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,908 INFO L273 TraceCheckUtils]: 172: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,908 INFO L273 TraceCheckUtils]: 173: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,908 INFO L273 TraceCheckUtils]: 174: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,909 INFO L273 TraceCheckUtils]: 175: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,909 INFO L273 TraceCheckUtils]: 176: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,910 INFO L273 TraceCheckUtils]: 177: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,910 INFO L273 TraceCheckUtils]: 178: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,911 INFO L273 TraceCheckUtils]: 179: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,911 INFO L273 TraceCheckUtils]: 180: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,912 INFO L273 TraceCheckUtils]: 181: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,912 INFO L273 TraceCheckUtils]: 182: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,913 INFO L273 TraceCheckUtils]: 183: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,913 INFO L273 TraceCheckUtils]: 184: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,914 INFO L273 TraceCheckUtils]: 185: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,914 INFO L273 TraceCheckUtils]: 186: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,915 INFO L273 TraceCheckUtils]: 187: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,915 INFO L273 TraceCheckUtils]: 188: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,916 INFO L273 TraceCheckUtils]: 189: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,916 INFO L273 TraceCheckUtils]: 190: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,917 INFO L273 TraceCheckUtils]: 191: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,917 INFO L273 TraceCheckUtils]: 192: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(~j~0 < ~edgecount~0); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,918 INFO L273 TraceCheckUtils]: 193: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,918 INFO L273 TraceCheckUtils]: 194: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,918 INFO L273 TraceCheckUtils]: 195: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(~i~0 < ~nodecount~0); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-14 19:18:53,919 INFO L273 TraceCheckUtils]: 196: Hoare triple {14238#(<= main_~edgecount~0 7)} ~i~0 := 0; {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-14 19:18:53,920 INFO L273 TraceCheckUtils]: 197: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} assume true; {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-14 19:18:53,921 INFO L273 TraceCheckUtils]: 198: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-14 19:18:53,921 INFO L273 TraceCheckUtils]: 199: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-14 19:18:53,922 INFO L273 TraceCheckUtils]: 200: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:53,923 INFO L273 TraceCheckUtils]: 201: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} assume true; {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:53,923 INFO L273 TraceCheckUtils]: 202: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:53,924 INFO L273 TraceCheckUtils]: 203: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:53,924 INFO L273 TraceCheckUtils]: 204: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:53,925 INFO L273 TraceCheckUtils]: 205: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} assume true; {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:53,925 INFO L273 TraceCheckUtils]: 206: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:53,926 INFO L273 TraceCheckUtils]: 207: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:53,927 INFO L273 TraceCheckUtils]: 208: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:53,927 INFO L273 TraceCheckUtils]: 209: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} assume true; {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:53,928 INFO L273 TraceCheckUtils]: 210: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:53,928 INFO L273 TraceCheckUtils]: 211: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:53,929 INFO L273 TraceCheckUtils]: 212: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:53,929 INFO L273 TraceCheckUtils]: 213: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} assume true; {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:53,930 INFO L273 TraceCheckUtils]: 214: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:53,930 INFO L273 TraceCheckUtils]: 215: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:53,931 INFO L273 TraceCheckUtils]: 216: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:53,932 INFO L273 TraceCheckUtils]: 217: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} assume true; {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:53,932 INFO L273 TraceCheckUtils]: 218: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:53,933 INFO L273 TraceCheckUtils]: 219: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:53,933 INFO L273 TraceCheckUtils]: 220: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:53,934 INFO L273 TraceCheckUtils]: 221: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} assume true; {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:53,934 INFO L273 TraceCheckUtils]: 222: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:53,935 INFO L273 TraceCheckUtils]: 223: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:53,936 INFO L273 TraceCheckUtils]: 224: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-14 19:18:53,936 INFO L273 TraceCheckUtils]: 225: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} assume true; {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-14 19:18:53,937 INFO L273 TraceCheckUtils]: 226: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-14 19:18:53,937 INFO L273 TraceCheckUtils]: 227: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-14 19:18:53,938 INFO L273 TraceCheckUtils]: 228: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} is VALID [2018-11-14 19:18:53,945 INFO L273 TraceCheckUtils]: 229: Hoare triple {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} assume true; {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} is VALID [2018-11-14 19:18:53,946 INFO L273 TraceCheckUtils]: 230: Hoare triple {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:53,946 INFO L273 TraceCheckUtils]: 231: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:53,946 INFO L273 TraceCheckUtils]: 232: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:53,946 INFO L273 TraceCheckUtils]: 233: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:53,946 INFO L273 TraceCheckUtils]: 234: Hoare triple {14229#false} assume !(~i~0 < ~edgecount~0); {14229#false} is VALID [2018-11-14 19:18:53,946 INFO L273 TraceCheckUtils]: 235: Hoare triple {14229#false} ~i~0 := 0; {14229#false} is VALID [2018-11-14 19:18:53,947 INFO L273 TraceCheckUtils]: 236: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:53,947 INFO L273 TraceCheckUtils]: 237: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:53,947 INFO L256 TraceCheckUtils]: 238: Hoare triple {14229#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {14229#false} is VALID [2018-11-14 19:18:53,947 INFO L273 TraceCheckUtils]: 239: Hoare triple {14229#false} ~cond := #in~cond; {14229#false} is VALID [2018-11-14 19:18:53,947 INFO L273 TraceCheckUtils]: 240: Hoare triple {14229#false} assume ~cond == 0; {14229#false} is VALID [2018-11-14 19:18:53,947 INFO L273 TraceCheckUtils]: 241: Hoare triple {14229#false} assume !false; {14229#false} is VALID [2018-11-14 19:18:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 1510 proven. 354 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2018-11-14 19:18:53,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:53,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:53,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:54,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:54,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {14228#true} call ULTIMATE.init(); {14228#true} is VALID [2018-11-14 19:18:54,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {14228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {14228#true} is VALID [2018-11-14 19:18:54,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-14 19:18:54,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14228#true} {14228#true} #108#return; {14228#true} is VALID [2018-11-14 19:18:54,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {14228#true} call #t~ret18 := main(); {14228#true} is VALID [2018-11-14 19:18:54,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {14228#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,967 INFO L273 TraceCheckUtils]: 26: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {14266#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:54,968 INFO L273 TraceCheckUtils]: 30: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:54,968 INFO L273 TraceCheckUtils]: 31: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:54,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:54,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:54,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:54,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:54,972 INFO L273 TraceCheckUtils]: 36: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:54,972 INFO L273 TraceCheckUtils]: 37: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:54,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:54,974 INFO L273 TraceCheckUtils]: 39: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:54,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:54,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:54,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:54,977 INFO L273 TraceCheckUtils]: 43: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume true; {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:54,977 INFO L273 TraceCheckUtils]: 44: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:54,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:54,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:54,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume true; {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:54,981 INFO L273 TraceCheckUtils]: 48: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:54,981 INFO L273 TraceCheckUtils]: 49: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:54,982 INFO L273 TraceCheckUtils]: 50: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:54,983 INFO L273 TraceCheckUtils]: 51: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume true; {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:54,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:54,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:54,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:54,986 INFO L273 TraceCheckUtils]: 55: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume true; {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:54,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:54,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:54,988 INFO L273 TraceCheckUtils]: 58: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-14 19:18:54,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume true; {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-14 19:18:54,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-14 19:18:54,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14229#false} is VALID [2018-11-14 19:18:54,990 INFO L273 TraceCheckUtils]: 62: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-14 19:18:54,990 INFO L273 TraceCheckUtils]: 64: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,990 INFO L273 TraceCheckUtils]: 65: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,990 INFO L273 TraceCheckUtils]: 66: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,991 INFO L273 TraceCheckUtils]: 67: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,991 INFO L273 TraceCheckUtils]: 68: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,991 INFO L273 TraceCheckUtils]: 69: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,991 INFO L273 TraceCheckUtils]: 70: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,991 INFO L273 TraceCheckUtils]: 72: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,992 INFO L273 TraceCheckUtils]: 73: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,992 INFO L273 TraceCheckUtils]: 74: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,992 INFO L273 TraceCheckUtils]: 75: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,992 INFO L273 TraceCheckUtils]: 76: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,992 INFO L273 TraceCheckUtils]: 77: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,992 INFO L273 TraceCheckUtils]: 78: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 79: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 80: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 81: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 82: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 83: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 84: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 85: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 86: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,993 INFO L273 TraceCheckUtils]: 87: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,994 INFO L273 TraceCheckUtils]: 88: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,994 INFO L273 TraceCheckUtils]: 89: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,994 INFO L273 TraceCheckUtils]: 90: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,994 INFO L273 TraceCheckUtils]: 91: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,994 INFO L273 TraceCheckUtils]: 92: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,994 INFO L273 TraceCheckUtils]: 93: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-14 19:18:54,995 INFO L273 TraceCheckUtils]: 94: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14229#false} is VALID [2018-11-14 19:18:54,995 INFO L273 TraceCheckUtils]: 95: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,995 INFO L273 TraceCheckUtils]: 96: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-14 19:18:54,995 INFO L273 TraceCheckUtils]: 97: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,995 INFO L273 TraceCheckUtils]: 98: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,995 INFO L273 TraceCheckUtils]: 99: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,996 INFO L273 TraceCheckUtils]: 100: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,996 INFO L273 TraceCheckUtils]: 101: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,996 INFO L273 TraceCheckUtils]: 102: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,996 INFO L273 TraceCheckUtils]: 103: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,996 INFO L273 TraceCheckUtils]: 104: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,996 INFO L273 TraceCheckUtils]: 105: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 106: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 107: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 108: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 109: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 110: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 111: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 112: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,997 INFO L273 TraceCheckUtils]: 113: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 114: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 115: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 116: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 117: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 118: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 119: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 120: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 121: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,998 INFO L273 TraceCheckUtils]: 122: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 123: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 124: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 125: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 126: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 127: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 128: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 129: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 130: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:54,999 INFO L273 TraceCheckUtils]: 131: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 132: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 133: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 134: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 135: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 136: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 137: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 138: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,000 INFO L273 TraceCheckUtils]: 139: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 140: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 141: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 142: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 143: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 144: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 145: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 146: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 147: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,001 INFO L273 TraceCheckUtils]: 148: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 149: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 150: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 151: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 152: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 153: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 154: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 155: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 156: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,002 INFO L273 TraceCheckUtils]: 157: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 158: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 159: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 160: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 161: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 162: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 163: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 164: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 165: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,003 INFO L273 TraceCheckUtils]: 166: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 167: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 168: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 169: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 170: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 171: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 172: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 173: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,004 INFO L273 TraceCheckUtils]: 174: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 175: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 176: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 177: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 178: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 179: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 180: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 181: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 182: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,005 INFO L273 TraceCheckUtils]: 183: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 184: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 185: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 186: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 187: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 188: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 189: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 190: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 191: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,006 INFO L273 TraceCheckUtils]: 192: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 193: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 194: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 195: Hoare triple {14229#false} assume !(~i~0 < ~nodecount~0); {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 196: Hoare triple {14229#false} ~i~0 := 0; {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 197: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 198: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 199: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 200: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,007 INFO L273 TraceCheckUtils]: 201: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 202: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 203: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 204: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 205: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 206: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 207: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 208: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,008 INFO L273 TraceCheckUtils]: 209: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 210: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 211: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 212: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 213: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 214: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 215: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 216: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 217: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,009 INFO L273 TraceCheckUtils]: 218: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 219: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 220: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 221: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 222: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 223: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 224: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 225: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,010 INFO L273 TraceCheckUtils]: 226: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 227: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 228: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 229: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 230: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 231: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 232: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 233: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 234: Hoare triple {14229#false} assume !(~i~0 < ~edgecount~0); {14229#false} is VALID [2018-11-14 19:18:55,011 INFO L273 TraceCheckUtils]: 235: Hoare triple {14229#false} ~i~0 := 0; {14229#false} is VALID [2018-11-14 19:18:55,012 INFO L273 TraceCheckUtils]: 236: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-14 19:18:55,012 INFO L273 TraceCheckUtils]: 237: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {14229#false} is VALID [2018-11-14 19:18:55,012 INFO L256 TraceCheckUtils]: 238: Hoare triple {14229#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {14229#false} is VALID [2018-11-14 19:18:55,012 INFO L273 TraceCheckUtils]: 239: Hoare triple {14229#false} ~cond := #in~cond; {14229#false} is VALID [2018-11-14 19:18:55,012 INFO L273 TraceCheckUtils]: 240: Hoare triple {14229#false} assume ~cond == 0; {14229#false} is VALID [2018-11-14 19:18:55,012 INFO L273 TraceCheckUtils]: 241: Hoare triple {14229#false} assume !false; {14229#false} is VALID [2018-11-14 19:18:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 914 proven. 98 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2018-11-14 19:18:55,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:55,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 29 [2018-11-14 19:18:55,063 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 242 [2018-11-14 19:18:55,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:55,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 19:18:55,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:55,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 19:18:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 19:18:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-11-14 19:18:55,217 INFO L87 Difference]: Start difference. First operand 247 states and 290 transitions. Second operand 29 states. [2018-11-14 19:18:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:56,944 INFO L93 Difference]: Finished difference Result 463 states and 555 transitions. [2018-11-14 19:18:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 19:18:56,944 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 242 [2018-11-14 19:18:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 19:18:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2018-11-14 19:18:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 19:18:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2018-11-14 19:18:56,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 110 transitions. [2018-11-14 19:18:57,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:57,067 INFO L225 Difference]: With dead ends: 463 [2018-11-14 19:18:57,067 INFO L226 Difference]: Without dead ends: 277 [2018-11-14 19:18:57,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-11-14 19:18:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-14 19:18:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2018-11-14 19:18:57,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:57,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand 267 states. [2018-11-14 19:18:57,738 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand 267 states. [2018-11-14 19:18:57,738 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 267 states. [2018-11-14 19:18:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:57,745 INFO L93 Difference]: Finished difference Result 277 states and 330 transitions. [2018-11-14 19:18:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-11-14 19:18:57,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:57,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:57,746 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 277 states. [2018-11-14 19:18:57,746 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 277 states. [2018-11-14 19:18:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:57,753 INFO L93 Difference]: Finished difference Result 277 states and 330 transitions. [2018-11-14 19:18:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-11-14 19:18:57,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:57,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:57,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:57,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-14 19:18:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2018-11-14 19:18:57,760 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 242 [2018-11-14 19:18:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:57,760 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2018-11-14 19:18:57,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 19:18:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2018-11-14 19:18:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-14 19:18:57,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:57,764 INFO L375 BasicCegarLoop]: trace histogram [45, 40, 40, 40, 10, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:57,764 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:57,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1287110198, now seen corresponding path program 8 times [2018-11-14 19:18:57,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:57,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:57,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:58,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {16469#true} call ULTIMATE.init(); {16469#true} is VALID [2018-11-14 19:18:58,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {16469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {16469#true} is VALID [2018-11-14 19:18:58,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16469#true} {16469#true} #108#return; {16469#true} is VALID [2018-11-14 19:18:58,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {16469#true} call #t~ret18 := main(); {16469#true} is VALID [2018-11-14 19:18:58,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {16469#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16469#true} is VALID [2018-11-14 19:18:58,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-14 19:18:58,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {16469#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16469#true} is VALID [2018-11-14 19:18:58,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-14 19:18:58,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16469#true} is VALID [2018-11-14 19:18:58,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-14 19:18:58,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16469#true} is VALID [2018-11-14 19:18:58,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-14 19:18:58,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16469#true} is VALID [2018-11-14 19:18:58,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-14 19:18:58,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16469#true} is VALID [2018-11-14 19:18:58,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {16469#true} assume !(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-14 19:18:58,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {16469#true} ~i~0 := 0; {16469#true} is VALID [2018-11-14 19:18:58,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-14 19:18:58,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,341 INFO L273 TraceCheckUtils]: 42: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,341 INFO L273 TraceCheckUtils]: 43: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,341 INFO L273 TraceCheckUtils]: 45: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,341 INFO L273 TraceCheckUtils]: 46: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,341 INFO L273 TraceCheckUtils]: 47: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,342 INFO L273 TraceCheckUtils]: 48: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,342 INFO L273 TraceCheckUtils]: 49: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,342 INFO L273 TraceCheckUtils]: 50: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,342 INFO L273 TraceCheckUtils]: 51: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,342 INFO L273 TraceCheckUtils]: 52: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,342 INFO L273 TraceCheckUtils]: 53: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,343 INFO L273 TraceCheckUtils]: 54: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,343 INFO L273 TraceCheckUtils]: 55: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,343 INFO L273 TraceCheckUtils]: 56: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,343 INFO L273 TraceCheckUtils]: 57: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,343 INFO L273 TraceCheckUtils]: 58: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,344 INFO L273 TraceCheckUtils]: 59: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,344 INFO L273 TraceCheckUtils]: 60: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,344 INFO L273 TraceCheckUtils]: 61: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,344 INFO L273 TraceCheckUtils]: 62: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,344 INFO L273 TraceCheckUtils]: 63: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,344 INFO L273 TraceCheckUtils]: 64: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-14 19:18:58,345 INFO L273 TraceCheckUtils]: 65: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16469#true} is VALID [2018-11-14 19:18:58,345 INFO L273 TraceCheckUtils]: 66: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,345 INFO L273 TraceCheckUtils]: 67: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-14 19:18:58,345 INFO L273 TraceCheckUtils]: 68: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,345 INFO L273 TraceCheckUtils]: 69: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,345 INFO L273 TraceCheckUtils]: 70: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,345 INFO L273 TraceCheckUtils]: 71: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,346 INFO L273 TraceCheckUtils]: 72: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,346 INFO L273 TraceCheckUtils]: 73: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,346 INFO L273 TraceCheckUtils]: 74: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,346 INFO L273 TraceCheckUtils]: 75: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,346 INFO L273 TraceCheckUtils]: 76: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,346 INFO L273 TraceCheckUtils]: 77: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,347 INFO L273 TraceCheckUtils]: 78: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,347 INFO L273 TraceCheckUtils]: 79: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,347 INFO L273 TraceCheckUtils]: 80: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,347 INFO L273 TraceCheckUtils]: 81: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,347 INFO L273 TraceCheckUtils]: 82: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,347 INFO L273 TraceCheckUtils]: 83: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,348 INFO L273 TraceCheckUtils]: 84: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,348 INFO L273 TraceCheckUtils]: 85: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,348 INFO L273 TraceCheckUtils]: 86: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,348 INFO L273 TraceCheckUtils]: 87: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,348 INFO L273 TraceCheckUtils]: 88: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,348 INFO L273 TraceCheckUtils]: 89: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,349 INFO L273 TraceCheckUtils]: 90: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,349 INFO L273 TraceCheckUtils]: 91: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,349 INFO L273 TraceCheckUtils]: 92: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,349 INFO L273 TraceCheckUtils]: 93: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,349 INFO L273 TraceCheckUtils]: 94: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,349 INFO L273 TraceCheckUtils]: 95: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,350 INFO L273 TraceCheckUtils]: 96: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,350 INFO L273 TraceCheckUtils]: 97: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,350 INFO L273 TraceCheckUtils]: 98: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,350 INFO L273 TraceCheckUtils]: 99: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,350 INFO L273 TraceCheckUtils]: 100: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,350 INFO L273 TraceCheckUtils]: 101: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-14 19:18:58,350 INFO L273 TraceCheckUtils]: 102: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16469#true} is VALID [2018-11-14 19:18:58,351 INFO L273 TraceCheckUtils]: 103: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,351 INFO L273 TraceCheckUtils]: 104: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-14 19:18:58,351 INFO L273 TraceCheckUtils]: 105: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,351 INFO L273 TraceCheckUtils]: 106: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,351 INFO L273 TraceCheckUtils]: 107: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,351 INFO L273 TraceCheckUtils]: 108: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,352 INFO L273 TraceCheckUtils]: 109: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,352 INFO L273 TraceCheckUtils]: 110: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,352 INFO L273 TraceCheckUtils]: 111: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,352 INFO L273 TraceCheckUtils]: 112: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,352 INFO L273 TraceCheckUtils]: 113: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,352 INFO L273 TraceCheckUtils]: 114: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,353 INFO L273 TraceCheckUtils]: 115: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,353 INFO L273 TraceCheckUtils]: 116: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,353 INFO L273 TraceCheckUtils]: 117: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,353 INFO L273 TraceCheckUtils]: 118: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,353 INFO L273 TraceCheckUtils]: 119: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,353 INFO L273 TraceCheckUtils]: 120: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,354 INFO L273 TraceCheckUtils]: 121: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,354 INFO L273 TraceCheckUtils]: 122: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,354 INFO L273 TraceCheckUtils]: 123: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,354 INFO L273 TraceCheckUtils]: 124: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,354 INFO L273 TraceCheckUtils]: 125: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,354 INFO L273 TraceCheckUtils]: 126: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,354 INFO L273 TraceCheckUtils]: 127: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,355 INFO L273 TraceCheckUtils]: 128: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,355 INFO L273 TraceCheckUtils]: 129: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,355 INFO L273 TraceCheckUtils]: 130: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,355 INFO L273 TraceCheckUtils]: 131: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,355 INFO L273 TraceCheckUtils]: 132: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,355 INFO L273 TraceCheckUtils]: 133: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,356 INFO L273 TraceCheckUtils]: 134: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,356 INFO L273 TraceCheckUtils]: 135: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,356 INFO L273 TraceCheckUtils]: 136: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,356 INFO L273 TraceCheckUtils]: 137: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,356 INFO L273 TraceCheckUtils]: 138: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-14 19:18:58,356 INFO L273 TraceCheckUtils]: 139: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16469#true} is VALID [2018-11-14 19:18:58,357 INFO L273 TraceCheckUtils]: 140: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,357 INFO L273 TraceCheckUtils]: 141: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-14 19:18:58,357 INFO L273 TraceCheckUtils]: 142: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,357 INFO L273 TraceCheckUtils]: 143: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,357 INFO L273 TraceCheckUtils]: 144: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,357 INFO L273 TraceCheckUtils]: 145: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,358 INFO L273 TraceCheckUtils]: 146: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,358 INFO L273 TraceCheckUtils]: 147: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,358 INFO L273 TraceCheckUtils]: 148: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,358 INFO L273 TraceCheckUtils]: 149: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,358 INFO L273 TraceCheckUtils]: 150: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,358 INFO L273 TraceCheckUtils]: 151: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,358 INFO L273 TraceCheckUtils]: 152: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,359 INFO L273 TraceCheckUtils]: 153: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,359 INFO L273 TraceCheckUtils]: 154: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,359 INFO L273 TraceCheckUtils]: 155: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,359 INFO L273 TraceCheckUtils]: 156: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,359 INFO L273 TraceCheckUtils]: 157: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,359 INFO L273 TraceCheckUtils]: 158: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,360 INFO L273 TraceCheckUtils]: 159: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,360 INFO L273 TraceCheckUtils]: 160: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,360 INFO L273 TraceCheckUtils]: 161: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,360 INFO L273 TraceCheckUtils]: 162: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,360 INFO L273 TraceCheckUtils]: 163: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,360 INFO L273 TraceCheckUtils]: 164: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,361 INFO L273 TraceCheckUtils]: 165: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,361 INFO L273 TraceCheckUtils]: 166: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,361 INFO L273 TraceCheckUtils]: 167: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,361 INFO L273 TraceCheckUtils]: 168: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,361 INFO L273 TraceCheckUtils]: 169: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,361 INFO L273 TraceCheckUtils]: 170: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,362 INFO L273 TraceCheckUtils]: 171: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16469#true} is VALID [2018-11-14 19:18:58,362 INFO L273 TraceCheckUtils]: 172: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16469#true} is VALID [2018-11-14 19:18:58,362 INFO L273 TraceCheckUtils]: 173: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16469#true} is VALID [2018-11-14 19:18:58,362 INFO L273 TraceCheckUtils]: 174: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,362 INFO L273 TraceCheckUtils]: 175: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-14 19:18:58,362 INFO L273 TraceCheckUtils]: 176: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16469#true} is VALID [2018-11-14 19:18:58,362 INFO L273 TraceCheckUtils]: 177: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:58,379 INFO L273 TraceCheckUtils]: 178: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16471#(= main_~j~0 0)} is VALID [2018-11-14 19:18:58,387 INFO L273 TraceCheckUtils]: 179: Hoare triple {16471#(= main_~j~0 0)} assume true; {16471#(= main_~j~0 0)} is VALID [2018-11-14 19:18:58,387 INFO L273 TraceCheckUtils]: 180: Hoare triple {16471#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16471#(= main_~j~0 0)} is VALID [2018-11-14 19:18:58,389 INFO L273 TraceCheckUtils]: 181: Hoare triple {16471#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16471#(= main_~j~0 0)} is VALID [2018-11-14 19:18:58,389 INFO L273 TraceCheckUtils]: 182: Hoare triple {16471#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16472#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:58,391 INFO L273 TraceCheckUtils]: 183: Hoare triple {16472#(<= main_~j~0 1)} assume true; {16472#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:58,391 INFO L273 TraceCheckUtils]: 184: Hoare triple {16472#(<= main_~j~0 1)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16472#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:58,393 INFO L273 TraceCheckUtils]: 185: Hoare triple {16472#(<= main_~j~0 1)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16472#(<= main_~j~0 1)} is VALID [2018-11-14 19:18:58,393 INFO L273 TraceCheckUtils]: 186: Hoare triple {16472#(<= main_~j~0 1)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16473#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:58,395 INFO L273 TraceCheckUtils]: 187: Hoare triple {16473#(<= main_~j~0 2)} assume true; {16473#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:58,395 INFO L273 TraceCheckUtils]: 188: Hoare triple {16473#(<= main_~j~0 2)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16473#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:58,397 INFO L273 TraceCheckUtils]: 189: Hoare triple {16473#(<= main_~j~0 2)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16473#(<= main_~j~0 2)} is VALID [2018-11-14 19:18:58,397 INFO L273 TraceCheckUtils]: 190: Hoare triple {16473#(<= main_~j~0 2)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16474#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:58,399 INFO L273 TraceCheckUtils]: 191: Hoare triple {16474#(<= main_~j~0 3)} assume true; {16474#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:58,399 INFO L273 TraceCheckUtils]: 192: Hoare triple {16474#(<= main_~j~0 3)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16474#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:58,399 INFO L273 TraceCheckUtils]: 193: Hoare triple {16474#(<= main_~j~0 3)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16474#(<= main_~j~0 3)} is VALID [2018-11-14 19:18:58,401 INFO L273 TraceCheckUtils]: 194: Hoare triple {16474#(<= main_~j~0 3)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16475#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:58,401 INFO L273 TraceCheckUtils]: 195: Hoare triple {16475#(<= main_~j~0 4)} assume true; {16475#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:58,403 INFO L273 TraceCheckUtils]: 196: Hoare triple {16475#(<= main_~j~0 4)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16475#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:58,403 INFO L273 TraceCheckUtils]: 197: Hoare triple {16475#(<= main_~j~0 4)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16475#(<= main_~j~0 4)} is VALID [2018-11-14 19:18:58,403 INFO L273 TraceCheckUtils]: 198: Hoare triple {16475#(<= main_~j~0 4)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16476#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:58,404 INFO L273 TraceCheckUtils]: 199: Hoare triple {16476#(<= main_~j~0 5)} assume true; {16476#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:58,404 INFO L273 TraceCheckUtils]: 200: Hoare triple {16476#(<= main_~j~0 5)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16476#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:58,404 INFO L273 TraceCheckUtils]: 201: Hoare triple {16476#(<= main_~j~0 5)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16476#(<= main_~j~0 5)} is VALID [2018-11-14 19:18:58,405 INFO L273 TraceCheckUtils]: 202: Hoare triple {16476#(<= main_~j~0 5)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16477#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:58,405 INFO L273 TraceCheckUtils]: 203: Hoare triple {16477#(<= main_~j~0 6)} assume true; {16477#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:58,405 INFO L273 TraceCheckUtils]: 204: Hoare triple {16477#(<= main_~j~0 6)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16477#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:58,406 INFO L273 TraceCheckUtils]: 205: Hoare triple {16477#(<= main_~j~0 6)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16477#(<= main_~j~0 6)} is VALID [2018-11-14 19:18:58,406 INFO L273 TraceCheckUtils]: 206: Hoare triple {16477#(<= main_~j~0 6)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16478#(<= main_~j~0 7)} is VALID [2018-11-14 19:18:58,407 INFO L273 TraceCheckUtils]: 207: Hoare triple {16478#(<= main_~j~0 7)} assume true; {16478#(<= main_~j~0 7)} is VALID [2018-11-14 19:18:58,407 INFO L273 TraceCheckUtils]: 208: Hoare triple {16478#(<= main_~j~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16478#(<= main_~j~0 7)} is VALID [2018-11-14 19:18:58,408 INFO L273 TraceCheckUtils]: 209: Hoare triple {16478#(<= main_~j~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16478#(<= main_~j~0 7)} is VALID [2018-11-14 19:18:58,408 INFO L273 TraceCheckUtils]: 210: Hoare triple {16478#(<= main_~j~0 7)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16479#(<= main_~j~0 8)} is VALID [2018-11-14 19:18:58,409 INFO L273 TraceCheckUtils]: 211: Hoare triple {16479#(<= main_~j~0 8)} assume true; {16479#(<= main_~j~0 8)} is VALID [2018-11-14 19:18:58,410 INFO L273 TraceCheckUtils]: 212: Hoare triple {16479#(<= main_~j~0 8)} assume !(~j~0 < ~edgecount~0); {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-14 19:18:58,410 INFO L273 TraceCheckUtils]: 213: Hoare triple {16480#(<= main_~edgecount~0 8)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-14 19:18:58,411 INFO L273 TraceCheckUtils]: 214: Hoare triple {16480#(<= main_~edgecount~0 8)} assume true; {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-14 19:18:58,411 INFO L273 TraceCheckUtils]: 215: Hoare triple {16480#(<= main_~edgecount~0 8)} assume !(~i~0 < ~nodecount~0); {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-14 19:18:58,412 INFO L273 TraceCheckUtils]: 216: Hoare triple {16480#(<= main_~edgecount~0 8)} ~i~0 := 0; {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-14 19:18:58,412 INFO L273 TraceCheckUtils]: 217: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} assume true; {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-14 19:18:58,413 INFO L273 TraceCheckUtils]: 218: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-14 19:18:58,414 INFO L273 TraceCheckUtils]: 219: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-14 19:18:58,415 INFO L273 TraceCheckUtils]: 220: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-14 19:18:58,415 INFO L273 TraceCheckUtils]: 221: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} assume true; {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-14 19:18:58,416 INFO L273 TraceCheckUtils]: 222: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-14 19:18:58,416 INFO L273 TraceCheckUtils]: 223: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-14 19:18:58,417 INFO L273 TraceCheckUtils]: 224: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:58,417 INFO L273 TraceCheckUtils]: 225: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} assume true; {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:58,418 INFO L273 TraceCheckUtils]: 226: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:58,418 INFO L273 TraceCheckUtils]: 227: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-14 19:18:58,419 INFO L273 TraceCheckUtils]: 228: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:58,420 INFO L273 TraceCheckUtils]: 229: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} assume true; {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:58,420 INFO L273 TraceCheckUtils]: 230: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:58,421 INFO L273 TraceCheckUtils]: 231: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-14 19:18:58,421 INFO L273 TraceCheckUtils]: 232: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:58,422 INFO L273 TraceCheckUtils]: 233: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} assume true; {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:58,423 INFO L273 TraceCheckUtils]: 234: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:58,423 INFO L273 TraceCheckUtils]: 235: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-14 19:18:58,424 INFO L273 TraceCheckUtils]: 236: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:58,424 INFO L273 TraceCheckUtils]: 237: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} assume true; {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:58,425 INFO L273 TraceCheckUtils]: 238: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:58,425 INFO L273 TraceCheckUtils]: 239: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-14 19:18:58,426 INFO L273 TraceCheckUtils]: 240: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:58,427 INFO L273 TraceCheckUtils]: 241: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} assume true; {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:58,427 INFO L273 TraceCheckUtils]: 242: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:58,428 INFO L273 TraceCheckUtils]: 243: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-14 19:18:58,428 INFO L273 TraceCheckUtils]: 244: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:58,429 INFO L273 TraceCheckUtils]: 245: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} assume true; {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:58,430 INFO L273 TraceCheckUtils]: 246: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:58,430 INFO L273 TraceCheckUtils]: 247: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-14 19:18:58,431 INFO L273 TraceCheckUtils]: 248: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16489#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-14 19:18:58,431 INFO L273 TraceCheckUtils]: 249: Hoare triple {16489#(<= main_~edgecount~0 main_~i~0)} assume true; {16489#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-14 19:18:58,432 INFO L273 TraceCheckUtils]: 250: Hoare triple {16489#(<= main_~edgecount~0 main_~i~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:58,432 INFO L273 TraceCheckUtils]: 251: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:58,433 INFO L273 TraceCheckUtils]: 252: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:58,433 INFO L273 TraceCheckUtils]: 253: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:58,433 INFO L273 TraceCheckUtils]: 254: Hoare triple {16470#false} assume !(~i~0 < ~edgecount~0); {16470#false} is VALID [2018-11-14 19:18:58,433 INFO L273 TraceCheckUtils]: 255: Hoare triple {16470#false} ~i~0 := 0; {16470#false} is VALID [2018-11-14 19:18:58,433 INFO L273 TraceCheckUtils]: 256: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:58,433 INFO L273 TraceCheckUtils]: 257: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:58,434 INFO L256 TraceCheckUtils]: 258: Hoare triple {16470#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {16470#false} is VALID [2018-11-14 19:18:58,434 INFO L273 TraceCheckUtils]: 259: Hoare triple {16470#false} ~cond := #in~cond; {16470#false} is VALID [2018-11-14 19:18:58,434 INFO L273 TraceCheckUtils]: 260: Hoare triple {16470#false} assume ~cond == 0; {16470#false} is VALID [2018-11-14 19:18:58,434 INFO L273 TraceCheckUtils]: 261: Hoare triple {16470#false} assume !false; {16470#false} is VALID [2018-11-14 19:18:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3792 backedges. 1306 proven. 158 refuted. 0 times theorem prover too weak. 2328 trivial. 0 not checked. [2018-11-14 19:18:58,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:58,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:58,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:58,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:18:58,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:58,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:59,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {16469#true} call ULTIMATE.init(); {16469#true} is VALID [2018-11-14 19:18:59,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {16469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {16469#true} is VALID [2018-11-14 19:18:59,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-14 19:18:59,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16469#true} {16469#true} #108#return; {16469#true} is VALID [2018-11-14 19:18:59,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {16469#true} call #t~ret18 := main(); {16469#true} is VALID [2018-11-14 19:18:59,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {16469#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,148 INFO L273 TraceCheckUtils]: 17: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,152 INFO L273 TraceCheckUtils]: 25: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,153 INFO L273 TraceCheckUtils]: 26: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,154 INFO L273 TraceCheckUtils]: 28: Hoare triple {16508#(<= 20 main_~edgecount~0)} ~i~0 := 0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-14 19:18:59,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:59,157 INFO L273 TraceCheckUtils]: 31: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:59,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:59,159 INFO L273 TraceCheckUtils]: 33: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:18:59,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:59,160 INFO L273 TraceCheckUtils]: 35: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:59,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:59,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:18:59,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:59,163 INFO L273 TraceCheckUtils]: 39: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:59,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:59,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:18:59,165 INFO L273 TraceCheckUtils]: 42: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:59,166 INFO L273 TraceCheckUtils]: 43: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume true; {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:59,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:59,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:18:59,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:59,169 INFO L273 TraceCheckUtils]: 47: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume true; {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:59,170 INFO L273 TraceCheckUtils]: 48: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:59,170 INFO L273 TraceCheckUtils]: 49: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:18:59,171 INFO L273 TraceCheckUtils]: 50: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:59,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume true; {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:59,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:59,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-14 19:18:59,174 INFO L273 TraceCheckUtils]: 54: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:59,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume true; {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:59,176 INFO L273 TraceCheckUtils]: 56: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:59,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:18:59,177 INFO L273 TraceCheckUtils]: 58: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-14 19:18:59,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume true; {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-14 19:18:59,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-14 19:18:59,179 INFO L273 TraceCheckUtils]: 61: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-14 19:18:59,180 INFO L273 TraceCheckUtils]: 62: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-14 19:18:59,180 INFO L273 TraceCheckUtils]: 63: Hoare triple {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} assume true; {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-14 19:18:59,181 INFO L273 TraceCheckUtils]: 64: Hoare triple {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-14 19:18:59,181 INFO L273 TraceCheckUtils]: 65: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16470#false} is VALID [2018-11-14 19:18:59,181 INFO L273 TraceCheckUtils]: 66: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,182 INFO L273 TraceCheckUtils]: 67: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-14 19:18:59,182 INFO L273 TraceCheckUtils]: 68: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,182 INFO L273 TraceCheckUtils]: 69: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,182 INFO L273 TraceCheckUtils]: 70: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,182 INFO L273 TraceCheckUtils]: 71: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,183 INFO L273 TraceCheckUtils]: 72: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,183 INFO L273 TraceCheckUtils]: 73: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,183 INFO L273 TraceCheckUtils]: 74: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,183 INFO L273 TraceCheckUtils]: 75: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,183 INFO L273 TraceCheckUtils]: 76: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 77: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 78: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 79: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 80: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 81: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 82: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 83: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,184 INFO L273 TraceCheckUtils]: 84: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 85: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 86: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 87: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 88: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 89: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 90: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 91: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 92: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,185 INFO L273 TraceCheckUtils]: 93: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 94: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 95: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 96: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 97: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 98: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 99: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 100: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,186 INFO L273 TraceCheckUtils]: 101: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 102: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 103: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 104: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 105: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 106: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 107: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 108: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 109: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,187 INFO L273 TraceCheckUtils]: 110: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 111: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 112: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 113: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 114: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 115: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 116: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 117: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 118: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,188 INFO L273 TraceCheckUtils]: 119: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 120: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 121: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 122: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 123: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 124: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 125: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 126: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 127: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,189 INFO L273 TraceCheckUtils]: 128: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 129: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 130: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 131: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 132: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 133: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 134: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 135: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 136: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 137: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 138: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 139: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 140: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 141: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 142: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 143: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 144: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 145: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,191 INFO L273 TraceCheckUtils]: 146: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 147: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 148: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 149: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 150: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 151: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 152: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 153: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 154: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,192 INFO L273 TraceCheckUtils]: 155: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 156: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 157: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 158: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 159: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 160: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 161: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 162: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,193 INFO L273 TraceCheckUtils]: 163: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 164: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 165: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 166: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 167: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 168: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 169: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 170: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 171: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,194 INFO L273 TraceCheckUtils]: 172: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 173: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 174: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 175: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 176: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 177: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 178: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 179: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 180: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,195 INFO L273 TraceCheckUtils]: 181: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 182: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 183: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 184: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 185: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 186: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 187: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 188: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 189: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,196 INFO L273 TraceCheckUtils]: 190: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 191: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 192: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 193: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 194: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 195: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 196: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 197: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 198: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,197 INFO L273 TraceCheckUtils]: 199: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 200: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 201: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 202: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 203: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 204: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 205: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 206: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 207: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,198 INFO L273 TraceCheckUtils]: 208: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 209: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 210: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 211: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 212: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 213: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 214: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 215: Hoare triple {16470#false} assume !(~i~0 < ~nodecount~0); {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 216: Hoare triple {16470#false} ~i~0 := 0; {16470#false} is VALID [2018-11-14 19:18:59,199 INFO L273 TraceCheckUtils]: 217: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 218: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 219: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 220: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 221: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 222: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 223: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 224: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 225: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,200 INFO L273 TraceCheckUtils]: 226: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 227: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 228: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 229: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 230: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 231: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 232: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 233: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 234: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,201 INFO L273 TraceCheckUtils]: 235: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 236: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 237: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 238: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 239: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 240: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 241: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 242: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 243: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,202 INFO L273 TraceCheckUtils]: 244: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 245: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 246: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 247: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 248: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 249: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 250: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 251: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 252: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {16470#false} is VALID [2018-11-14 19:18:59,203 INFO L273 TraceCheckUtils]: 253: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 254: Hoare triple {16470#false} assume !(~i~0 < ~edgecount~0); {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 255: Hoare triple {16470#false} ~i~0 := 0; {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 256: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 257: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L256 TraceCheckUtils]: 258: Hoare triple {16470#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 259: Hoare triple {16470#false} ~cond := #in~cond; {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 260: Hoare triple {16470#false} assume ~cond == 0; {16470#false} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 261: Hoare triple {16470#false} assume !false; {16470#false} is VALID [2018-11-14 19:18:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3792 backedges. 1170 proven. 128 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-11-14 19:18:59,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:59,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2018-11-14 19:18:59,265 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 262 [2018-11-14 19:18:59,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:59,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 19:18:59,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:59,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 19:18:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 19:18:59,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-11-14 19:18:59,463 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand 31 states. [2018-11-14 19:19:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:01,043 INFO L93 Difference]: Finished difference Result 499 states and 600 transitions. [2018-11-14 19:19:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 19:19:01,043 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 262 [2018-11-14 19:19:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 19:19:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 115 transitions. [2018-11-14 19:19:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 19:19:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 115 transitions. [2018-11-14 19:19:01,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 115 transitions. [2018-11-14 19:19:01,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:01,159 INFO L225 Difference]: With dead ends: 499 [2018-11-14 19:19:01,159 INFO L226 Difference]: Without dead ends: 297 [2018-11-14 19:19:01,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 19:19:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-14 19:19:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 287. [2018-11-14 19:19:01,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:01,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 287 states. [2018-11-14 19:19:01,917 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 287 states. [2018-11-14 19:19:01,917 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 287 states. [2018-11-14 19:19:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:01,923 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2018-11-14 19:19:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2018-11-14 19:19:01,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:01,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:01,924 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand 297 states. [2018-11-14 19:19:01,924 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 297 states. [2018-11-14 19:19:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:01,931 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2018-11-14 19:19:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2018-11-14 19:19:01,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:01,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:01,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:01,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-14 19:19:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 340 transitions. [2018-11-14 19:19:01,939 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 340 transitions. Word has length 262 [2018-11-14 19:19:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:01,939 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 340 transitions. [2018-11-14 19:19:01,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 19:19:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 340 transitions. [2018-11-14 19:19:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-14 19:19:01,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:01,943 INFO L375 BasicCegarLoop]: trace histogram [50, 45, 45, 45, 10, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:01,943 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:01,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:01,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1342408995, now seen corresponding path program 9 times [2018-11-14 19:19:01,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:01,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:01,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:19:01,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:02,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {18882#true} call ULTIMATE.init(); {18882#true} is VALID [2018-11-14 19:19:02,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {18882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {18882#true} is VALID [2018-11-14 19:19:02,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {18882#true} assume true; {18882#true} is VALID [2018-11-14 19:19:02,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18882#true} {18882#true} #108#return; {18882#true} is VALID [2018-11-14 19:19:02,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {18882#true} call #t~ret18 := main(); {18882#true} is VALID [2018-11-14 19:19:02,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {18882#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:02,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:02,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:02,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {18884#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:02,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,188 INFO L273 TraceCheckUtils]: 24: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {18884#(= main_~edgecount~0 20)} ~i~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,204 INFO L273 TraceCheckUtils]: 41: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,206 INFO L273 TraceCheckUtils]: 42: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,207 INFO L273 TraceCheckUtils]: 45: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,208 INFO L273 TraceCheckUtils]: 46: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,210 INFO L273 TraceCheckUtils]: 48: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,211 INFO L273 TraceCheckUtils]: 51: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,211 INFO L273 TraceCheckUtils]: 52: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,211 INFO L273 TraceCheckUtils]: 53: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,211 INFO L273 TraceCheckUtils]: 54: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,212 INFO L273 TraceCheckUtils]: 55: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,212 INFO L273 TraceCheckUtils]: 56: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,212 INFO L273 TraceCheckUtils]: 57: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,213 INFO L273 TraceCheckUtils]: 58: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,213 INFO L273 TraceCheckUtils]: 59: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,214 INFO L273 TraceCheckUtils]: 61: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,216 INFO L273 TraceCheckUtils]: 64: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,217 INFO L273 TraceCheckUtils]: 66: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,217 INFO L273 TraceCheckUtils]: 67: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,218 INFO L273 TraceCheckUtils]: 68: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,218 INFO L273 TraceCheckUtils]: 69: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,219 INFO L273 TraceCheckUtils]: 70: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,219 INFO L273 TraceCheckUtils]: 71: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,220 INFO L273 TraceCheckUtils]: 72: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,220 INFO L273 TraceCheckUtils]: 73: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,221 INFO L273 TraceCheckUtils]: 74: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,221 INFO L273 TraceCheckUtils]: 75: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,222 INFO L273 TraceCheckUtils]: 76: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,222 INFO L273 TraceCheckUtils]: 77: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,223 INFO L273 TraceCheckUtils]: 78: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,223 INFO L273 TraceCheckUtils]: 79: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,224 INFO L273 TraceCheckUtils]: 80: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,224 INFO L273 TraceCheckUtils]: 81: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,225 INFO L273 TraceCheckUtils]: 82: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,225 INFO L273 TraceCheckUtils]: 83: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,226 INFO L273 TraceCheckUtils]: 84: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,226 INFO L273 TraceCheckUtils]: 85: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,227 INFO L273 TraceCheckUtils]: 86: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,227 INFO L273 TraceCheckUtils]: 87: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,228 INFO L273 TraceCheckUtils]: 88: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,228 INFO L273 TraceCheckUtils]: 89: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,229 INFO L273 TraceCheckUtils]: 90: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,229 INFO L273 TraceCheckUtils]: 91: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,230 INFO L273 TraceCheckUtils]: 92: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,230 INFO L273 TraceCheckUtils]: 93: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,231 INFO L273 TraceCheckUtils]: 94: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,231 INFO L273 TraceCheckUtils]: 95: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,232 INFO L273 TraceCheckUtils]: 96: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,232 INFO L273 TraceCheckUtils]: 97: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,233 INFO L273 TraceCheckUtils]: 98: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,233 INFO L273 TraceCheckUtils]: 99: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,234 INFO L273 TraceCheckUtils]: 100: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,234 INFO L273 TraceCheckUtils]: 101: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,235 INFO L273 TraceCheckUtils]: 102: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,235 INFO L273 TraceCheckUtils]: 103: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,236 INFO L273 TraceCheckUtils]: 104: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,236 INFO L273 TraceCheckUtils]: 105: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,237 INFO L273 TraceCheckUtils]: 106: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,237 INFO L273 TraceCheckUtils]: 107: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,238 INFO L273 TraceCheckUtils]: 108: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,238 INFO L273 TraceCheckUtils]: 109: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,239 INFO L273 TraceCheckUtils]: 110: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,239 INFO L273 TraceCheckUtils]: 111: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,240 INFO L273 TraceCheckUtils]: 112: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,240 INFO L273 TraceCheckUtils]: 113: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,241 INFO L273 TraceCheckUtils]: 114: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,241 INFO L273 TraceCheckUtils]: 115: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,242 INFO L273 TraceCheckUtils]: 116: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,242 INFO L273 TraceCheckUtils]: 117: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,243 INFO L273 TraceCheckUtils]: 118: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,243 INFO L273 TraceCheckUtils]: 119: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,244 INFO L273 TraceCheckUtils]: 120: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,244 INFO L273 TraceCheckUtils]: 121: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,245 INFO L273 TraceCheckUtils]: 122: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,245 INFO L273 TraceCheckUtils]: 123: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,246 INFO L273 TraceCheckUtils]: 124: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,246 INFO L273 TraceCheckUtils]: 125: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,247 INFO L273 TraceCheckUtils]: 126: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,247 INFO L273 TraceCheckUtils]: 127: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,248 INFO L273 TraceCheckUtils]: 128: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,248 INFO L273 TraceCheckUtils]: 129: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,249 INFO L273 TraceCheckUtils]: 130: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,249 INFO L273 TraceCheckUtils]: 131: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,250 INFO L273 TraceCheckUtils]: 132: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,250 INFO L273 TraceCheckUtils]: 133: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,251 INFO L273 TraceCheckUtils]: 134: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,251 INFO L273 TraceCheckUtils]: 135: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,252 INFO L273 TraceCheckUtils]: 136: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,252 INFO L273 TraceCheckUtils]: 137: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,253 INFO L273 TraceCheckUtils]: 138: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,253 INFO L273 TraceCheckUtils]: 139: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,254 INFO L273 TraceCheckUtils]: 140: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,254 INFO L273 TraceCheckUtils]: 141: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,255 INFO L273 TraceCheckUtils]: 142: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,255 INFO L273 TraceCheckUtils]: 143: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,256 INFO L273 TraceCheckUtils]: 144: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,256 INFO L273 TraceCheckUtils]: 145: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,257 INFO L273 TraceCheckUtils]: 146: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,257 INFO L273 TraceCheckUtils]: 147: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,258 INFO L273 TraceCheckUtils]: 148: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,258 INFO L273 TraceCheckUtils]: 149: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,258 INFO L273 TraceCheckUtils]: 150: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,259 INFO L273 TraceCheckUtils]: 151: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,260 INFO L273 TraceCheckUtils]: 152: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,260 INFO L273 TraceCheckUtils]: 153: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,260 INFO L273 TraceCheckUtils]: 154: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,261 INFO L273 TraceCheckUtils]: 155: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,261 INFO L273 TraceCheckUtils]: 156: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,262 INFO L273 TraceCheckUtils]: 157: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,262 INFO L273 TraceCheckUtils]: 158: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,263 INFO L273 TraceCheckUtils]: 159: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,263 INFO L273 TraceCheckUtils]: 160: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,264 INFO L273 TraceCheckUtils]: 161: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,264 INFO L273 TraceCheckUtils]: 162: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,265 INFO L273 TraceCheckUtils]: 163: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,265 INFO L273 TraceCheckUtils]: 164: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,266 INFO L273 TraceCheckUtils]: 165: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,266 INFO L273 TraceCheckUtils]: 166: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,267 INFO L273 TraceCheckUtils]: 167: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,267 INFO L273 TraceCheckUtils]: 168: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,268 INFO L273 TraceCheckUtils]: 169: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,268 INFO L273 TraceCheckUtils]: 170: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,269 INFO L273 TraceCheckUtils]: 171: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,270 INFO L273 TraceCheckUtils]: 172: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,270 INFO L273 TraceCheckUtils]: 173: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,271 INFO L273 TraceCheckUtils]: 174: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,271 INFO L273 TraceCheckUtils]: 175: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,271 INFO L273 TraceCheckUtils]: 176: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,272 INFO L273 TraceCheckUtils]: 177: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,272 INFO L273 TraceCheckUtils]: 178: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,273 INFO L273 TraceCheckUtils]: 179: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,273 INFO L273 TraceCheckUtils]: 180: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,274 INFO L273 TraceCheckUtils]: 181: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,274 INFO L273 TraceCheckUtils]: 182: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,275 INFO L273 TraceCheckUtils]: 183: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,276 INFO L273 TraceCheckUtils]: 184: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,276 INFO L273 TraceCheckUtils]: 185: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,277 INFO L273 TraceCheckUtils]: 186: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,277 INFO L273 TraceCheckUtils]: 187: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,278 INFO L273 TraceCheckUtils]: 188: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,278 INFO L273 TraceCheckUtils]: 189: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,279 INFO L273 TraceCheckUtils]: 190: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,279 INFO L273 TraceCheckUtils]: 191: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,279 INFO L273 TraceCheckUtils]: 192: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,280 INFO L273 TraceCheckUtils]: 193: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-14 19:19:03,281 INFO L273 TraceCheckUtils]: 194: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,282 INFO L273 TraceCheckUtils]: 195: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,283 INFO L273 TraceCheckUtils]: 196: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,283 INFO L273 TraceCheckUtils]: 197: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,284 INFO L273 TraceCheckUtils]: 198: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,285 INFO L273 TraceCheckUtils]: 199: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,286 INFO L273 TraceCheckUtils]: 200: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,286 INFO L273 TraceCheckUtils]: 201: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,287 INFO L273 TraceCheckUtils]: 202: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,288 INFO L273 TraceCheckUtils]: 203: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,289 INFO L273 TraceCheckUtils]: 204: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,290 INFO L273 TraceCheckUtils]: 205: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,290 INFO L273 TraceCheckUtils]: 206: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,291 INFO L273 TraceCheckUtils]: 207: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,292 INFO L273 TraceCheckUtils]: 208: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,293 INFO L273 TraceCheckUtils]: 209: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,294 INFO L273 TraceCheckUtils]: 210: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,294 INFO L273 TraceCheckUtils]: 211: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume true; {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,295 INFO L273 TraceCheckUtils]: 212: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,296 INFO L273 TraceCheckUtils]: 213: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,297 INFO L273 TraceCheckUtils]: 214: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,297 INFO L273 TraceCheckUtils]: 215: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume true; {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,298 INFO L273 TraceCheckUtils]: 216: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,299 INFO L273 TraceCheckUtils]: 217: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,300 INFO L273 TraceCheckUtils]: 218: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-14 19:19:03,300 INFO L273 TraceCheckUtils]: 219: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} assume true; {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-14 19:19:03,301 INFO L273 TraceCheckUtils]: 220: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-14 19:19:03,302 INFO L273 TraceCheckUtils]: 221: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-14 19:19:03,303 INFO L273 TraceCheckUtils]: 222: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,303 INFO L273 TraceCheckUtils]: 223: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} assume true; {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,304 INFO L273 TraceCheckUtils]: 224: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,305 INFO L273 TraceCheckUtils]: 225: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,306 INFO L273 TraceCheckUtils]: 226: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,306 INFO L273 TraceCheckUtils]: 227: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} assume true; {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,307 INFO L273 TraceCheckUtils]: 228: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,308 INFO L273 TraceCheckUtils]: 229: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,309 INFO L273 TraceCheckUtils]: 230: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,310 INFO L273 TraceCheckUtils]: 231: Hoare triple {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} assume true; {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} is VALID [2018-11-14 19:19:03,310 INFO L273 TraceCheckUtils]: 232: Hoare triple {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {18883#false} is VALID [2018-11-14 19:19:03,310 INFO L273 TraceCheckUtils]: 233: Hoare triple {18883#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18883#false} is VALID [2018-11-14 19:19:03,311 INFO L273 TraceCheckUtils]: 234: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,311 INFO L273 TraceCheckUtils]: 235: Hoare triple {18883#false} assume !(~i~0 < ~nodecount~0); {18883#false} is VALID [2018-11-14 19:19:03,311 INFO L273 TraceCheckUtils]: 236: Hoare triple {18883#false} ~i~0 := 0; {18883#false} is VALID [2018-11-14 19:19:03,311 INFO L273 TraceCheckUtils]: 237: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,311 INFO L273 TraceCheckUtils]: 238: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,312 INFO L273 TraceCheckUtils]: 239: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,312 INFO L273 TraceCheckUtils]: 240: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,312 INFO L273 TraceCheckUtils]: 241: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,312 INFO L273 TraceCheckUtils]: 242: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,312 INFO L273 TraceCheckUtils]: 243: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,313 INFO L273 TraceCheckUtils]: 244: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,313 INFO L273 TraceCheckUtils]: 245: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,313 INFO L273 TraceCheckUtils]: 246: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,313 INFO L273 TraceCheckUtils]: 247: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,313 INFO L273 TraceCheckUtils]: 248: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,314 INFO L273 TraceCheckUtils]: 249: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,314 INFO L273 TraceCheckUtils]: 250: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,314 INFO L273 TraceCheckUtils]: 251: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,314 INFO L273 TraceCheckUtils]: 252: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,314 INFO L273 TraceCheckUtils]: 253: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,314 INFO L273 TraceCheckUtils]: 254: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,315 INFO L273 TraceCheckUtils]: 255: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,315 INFO L273 TraceCheckUtils]: 256: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,315 INFO L273 TraceCheckUtils]: 257: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,315 INFO L273 TraceCheckUtils]: 258: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,315 INFO L273 TraceCheckUtils]: 259: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 260: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 261: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 262: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 263: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 264: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 265: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 266: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,316 INFO L273 TraceCheckUtils]: 267: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 268: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 269: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 270: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 271: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 272: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 273: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 274: Hoare triple {18883#false} assume !(~i~0 < ~edgecount~0); {18883#false} is VALID [2018-11-14 19:19:03,317 INFO L273 TraceCheckUtils]: 275: Hoare triple {18883#false} ~i~0 := 0; {18883#false} is VALID [2018-11-14 19:19:03,318 INFO L273 TraceCheckUtils]: 276: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-14 19:19:03,318 INFO L273 TraceCheckUtils]: 277: Hoare triple {18883#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18883#false} is VALID [2018-11-14 19:19:03,318 INFO L256 TraceCheckUtils]: 278: Hoare triple {18883#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {18883#false} is VALID [2018-11-14 19:19:03,318 INFO L273 TraceCheckUtils]: 279: Hoare triple {18883#false} ~cond := #in~cond; {18883#false} is VALID [2018-11-14 19:19:03,318 INFO L273 TraceCheckUtils]: 280: Hoare triple {18883#false} assume ~cond == 0; {18883#false} is VALID [2018-11-14 19:19:03,318 INFO L273 TraceCheckUtils]: 281: Hoare triple {18883#false} assume !false; {18883#false} is VALID [2018-11-14 19:19:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4682 backedges. 1462 proven. 162 refuted. 0 times theorem prover too weak. 3058 trivial. 0 not checked. [2018-11-14 19:19:03,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:19:03,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:19:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:19:04,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 19:19:04,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:19:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:04,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:19:04,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-14 19:19:04,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-14 19:19:04,772 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 19:19:04,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:04,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:04,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:04,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-14 19:19:04,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:04,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:04,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:04,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:04,930 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:27, output treesize:13 [2018-11-14 19:19:04,932 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:19:05,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-14 19:19:05,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 19:19:05,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:05,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:05,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:05,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 19:19:05,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-14 19:19:05,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:05,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 19:19:05,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:05,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:05,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:05,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-11-14 19:19:05,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-14 19:19:05,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:05,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 45 [2018-11-14 19:19:05,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 19:19:05,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 19:19:05,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 19:19:05,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:75 [2018-11-14 19:19:05,544 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:19:05,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-11-14 19:19:05,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:05,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 65 [2018-11-14 19:19:05,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-14 19:19:05,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 19:19:06,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-14 19:19:06,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:06,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-14 19:19:06,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:06,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:06,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 19:19:06,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2018-11-14 19:19:06,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2018-11-14 19:19:06,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:06,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:06,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2018-11-14 19:19:06,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:06,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:06,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2018-11-14 19:19:06,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:06,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:06,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-11-14 19:19:06,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:07,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:07,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-14 19:19:07,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:131 [2018-11-14 19:19:19,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-14 19:19:19,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:19,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:19:19,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-14 19:19:19,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:3 [2018-11-14 19:19:19,434 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:19:19,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {18882#true} call ULTIMATE.init(); {18882#true} is VALID [2018-11-14 19:19:19,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {18882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {18882#true} is VALID [2018-11-14 19:19:19,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {18882#true} assume true; {18882#true} is VALID [2018-11-14 19:19:19,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18882#true} {18882#true} #108#return; {18882#true} is VALID [2018-11-14 19:19:19,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {18882#true} call #t~ret18 := main(); {18882#true} is VALID [2018-11-14 19:19:19,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {18882#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} assume true; {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18923#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,503 INFO L273 TraceCheckUtils]: 9: Hoare triple {18923#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0) (= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume true; {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume true; {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-14 19:19:19,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18950#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (* 4 main_~i~0) 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {18950#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (* 4 main_~i~0) 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume true; {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !!(~i~0 < ~nodecount~0); {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18964#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {18964#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume true; {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !!(~i~0 < ~nodecount~0); {18975#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (< main_~i~0 main_~nodecount~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {18975#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (< main_~i~0 main_~nodecount~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {18979#(or (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= 5 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)))) (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (< main_~i~0 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,528 INFO L273 TraceCheckUtils]: 25: Hoare triple {18979#(or (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= 5 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)))) (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (< main_~i~0 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= 5 main_~nodecount~0)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} assume true; {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} is VALID [2018-11-14 19:19:19,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} assume !(~i~0 < ~nodecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} ~i~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,534 INFO L273 TraceCheckUtils]: 30: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,538 INFO L273 TraceCheckUtils]: 34: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,541 INFO L273 TraceCheckUtils]: 37: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,544 INFO L273 TraceCheckUtils]: 40: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,548 INFO L273 TraceCheckUtils]: 44: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,549 INFO L273 TraceCheckUtils]: 45: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,550 INFO L273 TraceCheckUtils]: 46: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,551 INFO L273 TraceCheckUtils]: 47: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,555 INFO L273 TraceCheckUtils]: 49: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,555 INFO L273 TraceCheckUtils]: 50: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,556 INFO L273 TraceCheckUtils]: 51: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,557 INFO L273 TraceCheckUtils]: 52: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,558 INFO L273 TraceCheckUtils]: 55: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,559 INFO L273 TraceCheckUtils]: 56: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,560 INFO L273 TraceCheckUtils]: 57: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,561 INFO L273 TraceCheckUtils]: 58: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,562 INFO L273 TraceCheckUtils]: 59: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,563 INFO L273 TraceCheckUtils]: 60: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,564 INFO L273 TraceCheckUtils]: 61: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,565 INFO L273 TraceCheckUtils]: 62: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,566 INFO L273 TraceCheckUtils]: 63: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,569 INFO L273 TraceCheckUtils]: 66: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,570 INFO L273 TraceCheckUtils]: 67: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,571 INFO L273 TraceCheckUtils]: 68: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,572 INFO L273 TraceCheckUtils]: 69: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,573 INFO L273 TraceCheckUtils]: 70: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,575 INFO L273 TraceCheckUtils]: 72: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,576 INFO L273 TraceCheckUtils]: 73: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,577 INFO L273 TraceCheckUtils]: 74: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,578 INFO L273 TraceCheckUtils]: 75: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,579 INFO L273 TraceCheckUtils]: 76: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,580 INFO L273 TraceCheckUtils]: 77: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,583 INFO L273 TraceCheckUtils]: 80: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,585 INFO L273 TraceCheckUtils]: 81: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,586 INFO L273 TraceCheckUtils]: 82: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,587 INFO L273 TraceCheckUtils]: 83: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,587 INFO L273 TraceCheckUtils]: 84: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,589 INFO L273 TraceCheckUtils]: 85: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,590 INFO L273 TraceCheckUtils]: 86: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,591 INFO L273 TraceCheckUtils]: 87: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,592 INFO L273 TraceCheckUtils]: 88: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,593 INFO L273 TraceCheckUtils]: 89: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,594 INFO L273 TraceCheckUtils]: 90: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,595 INFO L273 TraceCheckUtils]: 91: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,596 INFO L273 TraceCheckUtils]: 92: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,597 INFO L273 TraceCheckUtils]: 93: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,598 INFO L273 TraceCheckUtils]: 94: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,599 INFO L273 TraceCheckUtils]: 95: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,600 INFO L273 TraceCheckUtils]: 96: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,601 INFO L273 TraceCheckUtils]: 97: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,602 INFO L273 TraceCheckUtils]: 98: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,603 INFO L273 TraceCheckUtils]: 99: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,604 INFO L273 TraceCheckUtils]: 100: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,605 INFO L273 TraceCheckUtils]: 101: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,606 INFO L273 TraceCheckUtils]: 102: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,607 INFO L273 TraceCheckUtils]: 103: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,608 INFO L273 TraceCheckUtils]: 104: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,609 INFO L273 TraceCheckUtils]: 105: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,610 INFO L273 TraceCheckUtils]: 106: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,611 INFO L273 TraceCheckUtils]: 107: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,612 INFO L273 TraceCheckUtils]: 108: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,613 INFO L273 TraceCheckUtils]: 109: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,614 INFO L273 TraceCheckUtils]: 110: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,615 INFO L273 TraceCheckUtils]: 111: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,616 INFO L273 TraceCheckUtils]: 112: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,617 INFO L273 TraceCheckUtils]: 113: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,618 INFO L273 TraceCheckUtils]: 114: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,619 INFO L273 TraceCheckUtils]: 115: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,620 INFO L273 TraceCheckUtils]: 116: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,621 INFO L273 TraceCheckUtils]: 117: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,622 INFO L273 TraceCheckUtils]: 118: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,623 INFO L273 TraceCheckUtils]: 119: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,624 INFO L273 TraceCheckUtils]: 120: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,625 INFO L273 TraceCheckUtils]: 121: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,627 INFO L273 TraceCheckUtils]: 122: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,628 INFO L273 TraceCheckUtils]: 123: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,629 INFO L273 TraceCheckUtils]: 124: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,629 INFO L273 TraceCheckUtils]: 125: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,631 INFO L273 TraceCheckUtils]: 126: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,632 INFO L273 TraceCheckUtils]: 127: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,633 INFO L273 TraceCheckUtils]: 128: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,634 INFO L273 TraceCheckUtils]: 129: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,655 INFO L273 TraceCheckUtils]: 130: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,675 INFO L273 TraceCheckUtils]: 131: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,690 INFO L273 TraceCheckUtils]: 132: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,705 INFO L273 TraceCheckUtils]: 133: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,720 INFO L273 TraceCheckUtils]: 134: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,736 INFO L273 TraceCheckUtils]: 135: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,745 INFO L273 TraceCheckUtils]: 136: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,757 INFO L273 TraceCheckUtils]: 137: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,773 INFO L273 TraceCheckUtils]: 138: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,782 INFO L273 TraceCheckUtils]: 139: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,794 INFO L273 TraceCheckUtils]: 140: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,807 INFO L273 TraceCheckUtils]: 141: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,820 INFO L273 TraceCheckUtils]: 142: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,834 INFO L273 TraceCheckUtils]: 143: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,843 INFO L273 TraceCheckUtils]: 144: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,855 INFO L273 TraceCheckUtils]: 145: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,868 INFO L273 TraceCheckUtils]: 146: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,881 INFO L273 TraceCheckUtils]: 147: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,900 INFO L273 TraceCheckUtils]: 148: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,911 INFO L273 TraceCheckUtils]: 149: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,924 INFO L273 TraceCheckUtils]: 150: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,938 INFO L273 TraceCheckUtils]: 151: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,951 INFO L273 TraceCheckUtils]: 152: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,965 INFO L273 TraceCheckUtils]: 153: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,979 INFO L273 TraceCheckUtils]: 154: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:19,994 INFO L273 TraceCheckUtils]: 155: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,009 INFO L273 TraceCheckUtils]: 156: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,023 INFO L273 TraceCheckUtils]: 157: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,038 INFO L273 TraceCheckUtils]: 158: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,052 INFO L273 TraceCheckUtils]: 159: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,066 INFO L273 TraceCheckUtils]: 160: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,081 INFO L273 TraceCheckUtils]: 161: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,095 INFO L273 TraceCheckUtils]: 162: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,096 INFO L273 TraceCheckUtils]: 163: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,097 INFO L273 TraceCheckUtils]: 164: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,098 INFO L273 TraceCheckUtils]: 165: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,098 INFO L273 TraceCheckUtils]: 166: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,099 INFO L273 TraceCheckUtils]: 167: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,100 INFO L273 TraceCheckUtils]: 168: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,101 INFO L273 TraceCheckUtils]: 169: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,102 INFO L273 TraceCheckUtils]: 170: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,103 INFO L273 TraceCheckUtils]: 171: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,104 INFO L273 TraceCheckUtils]: 172: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,105 INFO L273 TraceCheckUtils]: 173: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,106 INFO L273 TraceCheckUtils]: 174: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,107 INFO L273 TraceCheckUtils]: 175: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,108 INFO L273 TraceCheckUtils]: 176: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,109 INFO L273 TraceCheckUtils]: 177: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,110 INFO L273 TraceCheckUtils]: 178: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,111 INFO L273 TraceCheckUtils]: 179: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,112 INFO L273 TraceCheckUtils]: 180: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,113 INFO L273 TraceCheckUtils]: 181: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,114 INFO L273 TraceCheckUtils]: 182: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,115 INFO L273 TraceCheckUtils]: 183: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,118 INFO L273 TraceCheckUtils]: 184: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,119 INFO L273 TraceCheckUtils]: 185: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,120 INFO L273 TraceCheckUtils]: 186: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,120 INFO L273 TraceCheckUtils]: 187: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,122 INFO L273 TraceCheckUtils]: 188: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,122 INFO L273 TraceCheckUtils]: 189: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,124 INFO L273 TraceCheckUtils]: 190: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,125 INFO L273 TraceCheckUtils]: 191: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,126 INFO L273 TraceCheckUtils]: 192: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,127 INFO L273 TraceCheckUtils]: 193: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,128 INFO L273 TraceCheckUtils]: 194: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,129 INFO L273 TraceCheckUtils]: 195: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,134 INFO L273 TraceCheckUtils]: 196: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,136 INFO L273 TraceCheckUtils]: 197: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,136 INFO L273 TraceCheckUtils]: 198: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,138 INFO L273 TraceCheckUtils]: 199: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,139 INFO L273 TraceCheckUtils]: 200: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,141 INFO L273 TraceCheckUtils]: 201: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,142 INFO L273 TraceCheckUtils]: 202: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,143 INFO L273 TraceCheckUtils]: 203: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,144 INFO L273 TraceCheckUtils]: 204: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,146 INFO L273 TraceCheckUtils]: 205: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,148 INFO L273 TraceCheckUtils]: 206: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,149 INFO L273 TraceCheckUtils]: 207: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,154 INFO L273 TraceCheckUtils]: 208: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,158 INFO L273 TraceCheckUtils]: 209: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,158 INFO L273 TraceCheckUtils]: 210: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,160 INFO L273 TraceCheckUtils]: 211: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,160 INFO L273 TraceCheckUtils]: 212: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,162 INFO L273 TraceCheckUtils]: 213: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,163 INFO L273 TraceCheckUtils]: 214: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,164 INFO L273 TraceCheckUtils]: 215: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,165 INFO L273 TraceCheckUtils]: 216: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,167 INFO L273 TraceCheckUtils]: 217: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,168 INFO L273 TraceCheckUtils]: 218: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,169 INFO L273 TraceCheckUtils]: 219: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,170 INFO L273 TraceCheckUtils]: 220: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,172 INFO L273 TraceCheckUtils]: 221: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,173 INFO L273 TraceCheckUtils]: 222: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,174 INFO L273 TraceCheckUtils]: 223: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,175 INFO L273 TraceCheckUtils]: 224: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,177 INFO L273 TraceCheckUtils]: 225: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,178 INFO L273 TraceCheckUtils]: 226: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,179 INFO L273 TraceCheckUtils]: 227: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,180 INFO L273 TraceCheckUtils]: 228: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,182 INFO L273 TraceCheckUtils]: 229: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem5;havoc #t~mem6;havoc #t~mem7; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,183 INFO L273 TraceCheckUtils]: 230: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,184 INFO L273 TraceCheckUtils]: 231: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,185 INFO L273 TraceCheckUtils]: 232: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,186 INFO L273 TraceCheckUtils]: 233: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,187 INFO L273 TraceCheckUtils]: 234: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,188 INFO L273 TraceCheckUtils]: 235: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~i~0 < ~nodecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,189 INFO L273 TraceCheckUtils]: 236: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} ~i~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,190 INFO L273 TraceCheckUtils]: 237: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,191 INFO L273 TraceCheckUtils]: 238: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,193 INFO L273 TraceCheckUtils]: 239: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,194 INFO L273 TraceCheckUtils]: 240: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,195 INFO L273 TraceCheckUtils]: 241: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,196 INFO L273 TraceCheckUtils]: 242: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,198 INFO L273 TraceCheckUtils]: 243: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,199 INFO L273 TraceCheckUtils]: 244: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,200 INFO L273 TraceCheckUtils]: 245: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,200 INFO L273 TraceCheckUtils]: 246: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,202 INFO L273 TraceCheckUtils]: 247: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,203 INFO L273 TraceCheckUtils]: 248: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,204 INFO L273 TraceCheckUtils]: 249: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,205 INFO L273 TraceCheckUtils]: 250: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,207 INFO L273 TraceCheckUtils]: 251: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,208 INFO L273 TraceCheckUtils]: 252: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,209 INFO L273 TraceCheckUtils]: 253: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,210 INFO L273 TraceCheckUtils]: 254: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,212 INFO L273 TraceCheckUtils]: 255: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,213 INFO L273 TraceCheckUtils]: 256: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,214 INFO L273 TraceCheckUtils]: 257: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,215 INFO L273 TraceCheckUtils]: 258: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,220 INFO L273 TraceCheckUtils]: 259: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,220 INFO L273 TraceCheckUtils]: 260: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,225 INFO L273 TraceCheckUtils]: 261: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,225 INFO L273 TraceCheckUtils]: 262: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,226 INFO L273 TraceCheckUtils]: 263: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,231 INFO L273 TraceCheckUtils]: 264: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,232 INFO L273 TraceCheckUtils]: 265: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,233 INFO L273 TraceCheckUtils]: 266: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,233 INFO L273 TraceCheckUtils]: 267: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,235 INFO L273 TraceCheckUtils]: 268: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,242 INFO L273 TraceCheckUtils]: 269: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,243 INFO L273 TraceCheckUtils]: 270: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,244 INFO L273 TraceCheckUtils]: 271: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem14;havoc #t~mem15;havoc #t~mem13; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,244 INFO L273 TraceCheckUtils]: 272: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := #t~post10 + 1;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,246 INFO L273 TraceCheckUtils]: 273: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,247 INFO L273 TraceCheckUtils]: 274: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~i~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-14 19:19:20,248 INFO L273 TraceCheckUtils]: 275: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} ~i~0 := 0; {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} is VALID [2018-11-14 19:19:20,248 INFO L273 TraceCheckUtils]: 276: Hoare triple {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} assume true; {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} is VALID [2018-11-14 19:19:20,250 INFO L273 TraceCheckUtils]: 277: Hoare triple {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {19742#(<= 0 |main_#t~mem17|)} is VALID [2018-11-14 19:19:20,252 INFO L256 TraceCheckUtils]: 278: Hoare triple {19742#(<= 0 |main_#t~mem17|)} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {19746#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:19:20,252 INFO L273 TraceCheckUtils]: 279: Hoare triple {19746#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {19750#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:19:20,254 INFO L273 TraceCheckUtils]: 280: Hoare triple {19750#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {18883#false} is VALID [2018-11-14 19:19:20,254 INFO L273 TraceCheckUtils]: 281: Hoare triple {18883#false} assume !false; {18883#false} is VALID